./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 ff03de63 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-dev-ff03de6 [2021-12-21 17:35:54,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 17:35:54,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 17:35:54,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 17:35:54,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 17:35:54,178 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 17:35:54,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 17:35:54,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 17:35:54,181 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 17:35:54,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 17:35:54,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 17:35:54,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 17:35:54,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 17:35:54,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 17:35:54,185 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 17:35:54,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 17:35:54,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 17:35:54,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 17:35:54,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 17:35:54,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 17:35:54,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 17:35:54,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 17:35:54,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 17:35:54,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 17:35:54,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 17:35:54,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 17:35:54,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 17:35:54,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 17:35:54,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 17:35:54,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 17:35:54,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 17:35:54,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 17:35:54,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 17:35:54,201 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 17:35:54,202 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 17:35:54,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 17:35:54,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 17:35:54,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 17:35:54,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 17:35:54,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 17:35:54,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 17:35:54,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-21 17:35:54,219 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 17:35:54,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 17:35:54,219 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 17:35:54,219 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 17:35:54,220 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 17:35:54,220 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 17:35:54,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 17:35:54,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 17:35:54,221 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 17:35:54,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 17:35:54,221 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 17:35:54,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 17:35:54,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 17:35:54,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 17:35:54,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 17:35:54,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 17:35:54,222 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 17:35:54,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 17:35:54,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 17:35:54,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 17:35:54,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 17:35:54,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 17:35:54,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 17:35:54,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 17:35:54,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 17:35:54,224 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 17:35:54,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 17:35:54,224 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 17:35:54,224 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 17:35:54,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 17:35:54,225 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 17:35:54,225 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-21 17:35:54,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 17:35:54,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 17:35:54,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 17:35:54,414 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 17:35:54,414 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 17:35:54,415 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-21 17:35:54,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b24a8f21c/b144820608684fdc8346246d77395bac/FLAG8561fbbe1 [2021-12-21 17:35:55,101 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 17:35:55,102 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-21 17:35:55,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b24a8f21c/b144820608684fdc8346246d77395bac/FLAG8561fbbe1 [2021-12-21 17:35:55,446 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b24a8f21c/b144820608684fdc8346246d77395bac [2021-12-21 17:35:55,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 17:35:55,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 17:35:55,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 17:35:55,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 17:35:55,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 17:35:55,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:35:55" (1/1) ... [2021-12-21 17:35:55,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7934f1c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:55, skipping insertion in model container [2021-12-21 17:35:55,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:35:55" (1/1) ... [2021-12-21 17:35:55,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 17:35:55,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 17:35:57,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292355,292368] [2021-12-21 17:35:57,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292520,292533] [2021-12-21 17:35:57,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292836,292849] [2021-12-21 17:35:57,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292994,293007] [2021-12-21 17:35:57,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293154,293167] [2021-12-21 17:35:57,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293313,293326] [2021-12-21 17:35:57,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293452,293465] [2021-12-21 17:35:57,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293594,293607] [2021-12-21 17:35:57,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293743,293756] [2021-12-21 17:35:57,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293882,293895] [2021-12-21 17:35:57,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294037,294050] [2021-12-21 17:35:57,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294197,294210] [2021-12-21 17:35:57,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294348,294361] [2021-12-21 17:35:57,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294499,294512] [2021-12-21 17:35:57,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294651,294664] [2021-12-21 17:35:57,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294800,294813] [2021-12-21 17:35:57,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294948,294961] [2021-12-21 17:35:57,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2021-12-21 17:35:57,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2021-12-21 17:35:57,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2021-12-21 17:35:57,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2021-12-21 17:35:57,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2021-12-21 17:35:57,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2021-12-21 17:35:57,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2021-12-21 17:35:57,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2021-12-21 17:35:57,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2021-12-21 17:35:57,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2021-12-21 17:35:57,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2021-12-21 17:35:57,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2021-12-21 17:35:57,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2021-12-21 17:35:57,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2021-12-21 17:35:57,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2021-12-21 17:35:57,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2021-12-21 17:35:57,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2021-12-21 17:35:57,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2021-12-21 17:35:57,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2021-12-21 17:35:57,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2021-12-21 17:35:57,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2021-12-21 17:35:57,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2021-12-21 17:35:57,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2021-12-21 17:35:57,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2021-12-21 17:35:57,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2021-12-21 17:35:57,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2021-12-21 17:35:57,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2021-12-21 17:35:57,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2021-12-21 17:35:57,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2021-12-21 17:35:57,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2021-12-21 17:35:57,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2021-12-21 17:35:57,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2021-12-21 17:35:57,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2021-12-21 17:35:57,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2021-12-21 17:35:57,070 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2021-12-21 17:35:57,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2021-12-21 17:35:57,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2021-12-21 17:35:57,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2021-12-21 17:35:57,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2021-12-21 17:35:57,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2021-12-21 17:35:57,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2021-12-21 17:35:57,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2021-12-21 17:35:57,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2021-12-21 17:35:57,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2021-12-21 17:35:57,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2021-12-21 17:35:57,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2021-12-21 17:35:57,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2021-12-21 17:35:57,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2021-12-21 17:35:57,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2021-12-21 17:35:57,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2021-12-21 17:35:57,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2021-12-21 17:35:57,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2021-12-21 17:35:57,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2021-12-21 17:35:57,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303542,303555] [2021-12-21 17:35:57,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303693,303706] [2021-12-21 17:35:57,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303844,303857] [2021-12-21 17:35:57,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303992,304005] [2021-12-21 17:35:57,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304158,304171] [2021-12-21 17:35:57,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304327,304340] [2021-12-21 17:35:57,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304494,304507] [2021-12-21 17:35:57,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304662,304675] [2021-12-21 17:35:57,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304812,304825] [2021-12-21 17:35:57,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,090 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 17:35:57,123 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 17:35:57,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292064,292077] [2021-12-21 17:35:57,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292209,292222] [2021-12-21 17:35:57,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292355,292368] [2021-12-21 17:35:57,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292520,292533] [2021-12-21 17:35:57,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292678,292691] [2021-12-21 17:35:57,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292836,292849] [2021-12-21 17:35:57,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292994,293007] [2021-12-21 17:35:57,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293154,293167] [2021-12-21 17:35:57,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293313,293326] [2021-12-21 17:35:57,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2021-12-21 17:35:57,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2021-12-21 17:35:57,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-21 17:35:57,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2021-12-21 17:35:57,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2021-12-21 17:35:57,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2021-12-21 17:35:57,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2021-12-21 17:35:57,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2021-12-21 17:35:57,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2021-12-21 17:35:57,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2021-12-21 17:35:57,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2021-12-21 17:35:57,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2021-12-21 17:35:57,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2021-12-21 17:35:57,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2021-12-21 17:35:57,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2021-12-21 17:35:57,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2021-12-21 17:35:57,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2021-12-21 17:35:57,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2021-12-21 17:35:57,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2021-12-21 17:35:57,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2021-12-21 17:35:57,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2021-12-21 17:35:57,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2021-12-21 17:35:57,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2021-12-21 17:35:57,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2021-12-21 17:35:57,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2021-12-21 17:35:57,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2021-12-21 17:35:57,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2021-12-21 17:35:57,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2021-12-21 17:35:57,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2021-12-21 17:35:57,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2021-12-21 17:35:57,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2021-12-21 17:35:57,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2021-12-21 17:35:57,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2021-12-21 17:35:57,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2021-12-21 17:35:57,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2021-12-21 17:35:57,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2021-12-21 17:35:57,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2021-12-21 17:35:57,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2021-12-21 17:35:57,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2021-12-21 17:35:57,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2021-12-21 17:35:57,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2021-12-21 17:35:57,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2021-12-21 17:35:57,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2021-12-21 17:35:57,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2021-12-21 17:35:57,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2021-12-21 17:35:57,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2021-12-21 17:35:57,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2021-12-21 17:35:57,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2021-12-21 17:35:57,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2021-12-21 17:35:57,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2021-12-21 17:35:57,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2021-12-21 17:35:57,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2021-12-21 17:35:57,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2021-12-21 17:35:57,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2021-12-21 17:35:57,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303542,303555] [2021-12-21 17:35:57,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303693,303706] [2021-12-21 17:35:57,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303844,303857] [2021-12-21 17:35:57,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303992,304005] [2021-12-21 17:35:57,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304158,304171] [2021-12-21 17:35:57,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304327,304340] [2021-12-21 17:35:57,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304494,304507] [2021-12-21 17:35:57,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304662,304675] [2021-12-21 17:35:57,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304812,304825] [2021-12-21 17:35:57,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304959,304972] [2021-12-21 17:35:57,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305120,305133] [2021-12-21 17:35:57,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305290,305303] [2021-12-21 17:35:57,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305452,305465] [2021-12-21 17:35:57,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 17:35:57,459 INFO L208 MainTranslator]: Completed translation [2021-12-21 17:35:57,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:57 WrapperNode [2021-12-21 17:35:57,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 17:35:57,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 17:35:57,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 17:35:57,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 17:35:57,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:57" (1/1) ... [2021-12-21 17:35:57,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:57" (1/1) ... [2021-12-21 17:35:57,610 INFO L137 Inliner]: procedures = 519, calls = 1770, calls flagged for inlining = 206, calls inlined = 55, statements flattened = 940 [2021-12-21 17:35:57,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 17:35:57,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 17:35:57,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 17:35:57,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 17:35:57,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:57" (1/1) ... [2021-12-21 17:35:57,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:57" (1/1) ... [2021-12-21 17:35:57,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:57" (1/1) ... [2021-12-21 17:35:57,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:57" (1/1) ... [2021-12-21 17:35:57,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:57" (1/1) ... [2021-12-21 17:35:57,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:57" (1/1) ... [2021-12-21 17:35:57,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:57" (1/1) ... [2021-12-21 17:35:57,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 17:35:57,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 17:35:57,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 17:35:57,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 17:35:57,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:57" (1/1) ... [2021-12-21 17:35:57,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 17:35:57,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:35:57,717 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-21 17:35:57,724 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-21 17:35:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_usb_gadget__class_registration_with_usb_gadget [2021-12-21 17:35:57,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_usb_gadget__class_registration_with_usb_gadget [2021-12-21 17:35:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2021-12-21 17:35:57,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2021-12-21 17:35:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-21 17:35:57,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-21 17:35:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-21 17:35:57,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-21 17:35:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-21 17:35:57,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-21 17:35:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-21 17:35:57,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-21 17:35:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-21 17:35:57,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-21 17:35:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-21 17:35:57,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-21 17:35:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-21 17:35:57,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-21 17:35:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-21 17:35:57,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-21 17:35:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-21 17:35:57,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-21 17:35:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-21 17:35:57,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-21 17:35:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 17:35:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-21 17:35:57,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-21 17:35:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-21 17:35:57,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-21 17:35:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_fs_char_dev__double_registration [2021-12-21 17:35:57,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_fs_char_dev__double_registration [2021-12-21 17:35:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-21 17:35:57,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-21 17:35:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-21 17:35:57,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-21 17:35:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 17:35:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 17:35:57,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-21 17:35:57,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-21 17:35:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-21 17:35:57,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-21 17:35:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 17:35:57,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 17:35:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2021-12-21 17:35:57,750 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2021-12-21 17:35:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-21 17:35:57,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-21 17:35:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_destroy_class [2021-12-21 17:35:57,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_destroy_class [2021-12-21 17:35:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-21 17:35:57,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-21 17:35:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-21 17:35:57,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-21 17:35:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-21 17:35:57,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-21 17:35:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_drivers_base_class__double_registration [2021-12-21 17:35:57,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_drivers_base_class__double_registration [2021-12-21 17:35:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_destroy_class [2021-12-21 17:35:57,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_destroy_class [2021-12-21 17:35:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-21 17:35:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-21 17:35:57,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-21 17:35:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-21 17:35:57,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-21 17:35:57,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-21 17:35:57,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-21 17:35:57,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-21 17:35:57,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-21 17:35:57,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-21 17:35:57,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-21 17:35:57,753 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-21 17:35:57,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-21 17:35:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-21 17:35:57,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-21 17:35:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-21 17:35:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-21 17:35:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-21 17:35:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-21 17:35:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 17:35:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadget [2021-12-21 17:35:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadget [2021-12-21 17:35:57,991 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 17:35:57,993 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 17:35:58,124 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-21 17:35:58,504 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 17:35:58,511 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 17:35:58,511 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-21 17:35:58,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:35:58 BoogieIcfgContainer [2021-12-21 17:35:58,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 17:35:58,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 17:35:58,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 17:35:58,516 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 17:35:58,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:35:55" (1/3) ... [2021-12-21 17:35:58,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465dacbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:35:58, skipping insertion in model container [2021-12-21 17:35:58,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:35:57" (2/3) ... [2021-12-21 17:35:58,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465dacbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:35:58, skipping insertion in model container [2021-12-21 17:35:58,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:35:58" (3/3) ... [2021-12-21 17:35:58,519 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2021-12-21 17:35:58,522 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 17:35:58,523 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2021-12-21 17:35:58,555 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 17:35:58,560 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-21 17:35:58,560 INFO L340 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2021-12-21 17:35:58,576 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-21 17:35:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-21 17:35:58,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:35:58,581 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-21 17:35:58,582 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-21 17:35:58,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:35:58,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1456749468, now seen corresponding path program 1 times [2021-12-21 17:35:58,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:35:58,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223076683] [2021-12-21 17:35:58,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:35:58,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:35:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:35:58,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:35:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:35:59,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:35:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:35:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:35:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:35:59,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 17:35:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:35:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 17:35:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:35:59,084 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-21 17:35:59,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:35:59,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223076683] [2021-12-21 17:35:59,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223076683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:35:59,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:35:59,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:35:59,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075439981] [2021-12-21 17:35:59,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:35:59,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:35:59,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:35:59,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:35:59,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:35:59,119 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-21 17:36:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:00,161 INFO L93 Difference]: Finished difference Result 1054 states and 1373 transitions. [2021-12-21 17:36:00,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:36:00,163 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-21 17:36:00,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:00,173 INFO L225 Difference]: With dead ends: 1054 [2021-12-21 17:36:00,173 INFO L226 Difference]: Without dead ends: 691 [2021-12-21 17:36:00,177 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-21 17:36:00,179 INFO L933 BasicCegarLoop]: 752 mSDtfsCounter, 539 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:00,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [607 Valid, 1837 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-21 17:36:00,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-12-21 17:36:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 480. [2021-12-21 17:36:00,250 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-21 17:36:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 557 transitions. [2021-12-21 17:36:00,254 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 557 transitions. Word has length 35 [2021-12-21 17:36:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:00,254 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 557 transitions. [2021-12-21 17:36:00,255 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-21 17:36:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 557 transitions. [2021-12-21 17:36:00,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-21 17:36:00,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:00,257 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-21 17:36:00,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 17:36:00,257 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-21 17:36:00,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:00,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1101797720, now seen corresponding path program 1 times [2021-12-21 17:36:00,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:00,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754276438] [2021-12-21 17:36:00,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:00,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:00,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:00,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:00,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 17:36:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:00,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 17:36:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:00,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 17:36:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-21 17:36:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:00,434 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-21 17:36:00,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:00,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754276438] [2021-12-21 17:36:00,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754276438] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:00,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:00,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:36:00,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806867841] [2021-12-21 17:36:00,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:00,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:36:00,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:00,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:36:00,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:36:00,438 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-21 17:36:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:00,867 INFO L93 Difference]: Finished difference Result 482 states and 559 transitions. [2021-12-21 17:36:00,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 17:36:00,867 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-21 17:36:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:00,870 INFO L225 Difference]: With dead ends: 482 [2021-12-21 17:36:00,870 INFO L226 Difference]: Without dead ends: 480 [2021-12-21 17:36:00,871 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-21 17:36:00,871 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 508 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-21 17:36:00,872 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-21 17:36:00,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-12-21 17:36:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2021-12-21 17:36:00,885 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-21 17:36:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 554 transitions. [2021-12-21 17:36:00,887 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 554 transitions. Word has length 48 [2021-12-21 17:36:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:00,887 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 554 transitions. [2021-12-21 17:36:00,887 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-21 17:36:00,888 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 554 transitions. [2021-12-21 17:36:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-21 17:36:00,890 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:00,890 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-21 17:36:00,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 17:36:00,890 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-21 17:36:00,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:00,891 INFO L85 PathProgramCache]: Analyzing trace with hash 951373245, now seen corresponding path program 1 times [2021-12-21 17:36:00,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:00,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492855778] [2021-12-21 17:36:00,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:00,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 17:36:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 17:36:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 17:36:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-21 17:36:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 17:36:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 17:36:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 17:36:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,104 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-21 17:36:01,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:01,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492855778] [2021-12-21 17:36:01,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492855778] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:01,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:01,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:36:01,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482824368] [2021-12-21 17:36:01,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:01,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:36:01,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:01,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:36:01,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:36:01,106 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-21 17:36:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:01,771 INFO L93 Difference]: Finished difference Result 821 states and 930 transitions. [2021-12-21 17:36:01,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:36:01,771 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-21 17:36:01,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:01,775 INFO L225 Difference]: With dead ends: 821 [2021-12-21 17:36:01,776 INFO L226 Difference]: Without dead ends: 819 [2021-12-21 17:36:01,776 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-21 17:36:01,777 INFO L933 BasicCegarLoop]: 468 mSDtfsCounter, 632 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:01,777 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.6s Time] [2021-12-21 17:36:01,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-12-21 17:36:01,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 672. [2021-12-21 17:36:01,801 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-21 17:36:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 785 transitions. [2021-12-21 17:36:01,804 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 785 transitions. Word has length 86 [2021-12-21 17:36:01,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:01,804 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 785 transitions. [2021-12-21 17:36:01,825 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-21 17:36:01,825 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 785 transitions. [2021-12-21 17:36:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-21 17:36:01,827 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:01,828 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-21 17:36:01,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 17:36:01,828 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-21 17:36:01,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:01,829 INFO L85 PathProgramCache]: Analyzing trace with hash -292723993, now seen corresponding path program 1 times [2021-12-21 17:36:01,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:01,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547331760] [2021-12-21 17:36:01,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:01,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 17:36:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 17:36:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 17:36:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-21 17:36:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:01,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 17:36:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 17:36:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 17:36:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:36:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,049 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-21 17:36:02,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:02,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547331760] [2021-12-21 17:36:02,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547331760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:02,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:02,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 17:36:02,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974803701] [2021-12-21 17:36:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:02,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 17:36:02,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:02,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 17:36:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 17:36:02,052 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-21 17:36:02,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:02,465 INFO L93 Difference]: Finished difference Result 674 states and 787 transitions. [2021-12-21 17:36:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 17:36:02,465 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-21 17:36:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:02,469 INFO L225 Difference]: With dead ends: 674 [2021-12-21 17:36:02,469 INFO L226 Difference]: Without dead ends: 672 [2021-12-21 17:36:02,470 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-21 17:36:02,470 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 487 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:02,470 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.4s Time] [2021-12-21 17:36:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-12-21 17:36:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 670. [2021-12-21 17:36:02,491 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-21 17:36:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 781 transitions. [2021-12-21 17:36:02,494 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 781 transitions. Word has length 105 [2021-12-21 17:36:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:02,495 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 781 transitions. [2021-12-21 17:36:02,495 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-21 17:36:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 781 transitions. [2021-12-21 17:36:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-21 17:36:02,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:02,497 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-21 17:36:02,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 17:36:02,498 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-21 17:36:02,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash -876569357, now seen corresponding path program 1 times [2021-12-21 17:36:02,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:02,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445155767] [2021-12-21 17:36:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:02,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 17:36:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 17:36:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 17:36:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-21 17:36:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 17:36:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 17:36:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-21 17:36:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:36:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-21 17:36:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-21 17:36:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:02,722 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-21 17:36:02,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:02,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445155767] [2021-12-21 17:36:02,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445155767] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:02,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:02,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 17:36:02,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061572793] [2021-12-21 17:36:02,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:02,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 17:36:02,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 17:36:02,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 17:36:02,724 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-21 17:36:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:03,245 INFO L93 Difference]: Finished difference Result 672 states and 783 transitions. [2021-12-21 17:36:03,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 17:36:03,246 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-21 17:36:03,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:03,249 INFO L225 Difference]: With dead ends: 672 [2021-12-21 17:36:03,249 INFO L226 Difference]: Without dead ends: 670 [2021-12-21 17:36:03,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-21 17:36:03,250 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 838 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:03,250 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.4s Time] [2021-12-21 17:36:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-12-21 17:36:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2021-12-21 17:36:03,269 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-21 17:36:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 778 transitions. [2021-12-21 17:36:03,272 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 778 transitions. Word has length 107 [2021-12-21 17:36:03,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:03,273 INFO L470 AbstractCegarLoop]: Abstraction has 668 states and 778 transitions. [2021-12-21 17:36:03,273 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-21 17:36:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 778 transitions. [2021-12-21 17:36:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-21 17:36:03,274 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:03,274 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-21 17:36:03,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 17:36:03,275 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-21 17:36:03,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1725971280, now seen corresponding path program 1 times [2021-12-21 17:36:03,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:03,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029147296] [2021-12-21 17:36:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:03,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 17:36:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 17:36:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 17:36:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-21 17:36:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 17:36:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 17:36:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-21 17:36:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:36:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-21 17:36:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-21 17:36:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-21 17:36:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:03,465 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-21 17:36:03,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:03,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029147296] [2021-12-21 17:36:03,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029147296] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:03,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:03,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 17:36:03,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911219] [2021-12-21 17:36:03,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:03,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 17:36:03,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:03,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 17:36:03,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 17:36:03,467 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-21 17:36:03,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:03,918 INFO L93 Difference]: Finished difference Result 670 states and 780 transitions. [2021-12-21 17:36:03,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 17:36:03,918 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-21 17:36:03,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:03,921 INFO L225 Difference]: With dead ends: 670 [2021-12-21 17:36:03,921 INFO L226 Difference]: Without dead ends: 668 [2021-12-21 17:36:03,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-21 17:36:03,922 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 830 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:03,923 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.4s Time] [2021-12-21 17:36:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-12-21 17:36:03,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2021-12-21 17:36:03,941 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-21 17:36:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 775 transitions. [2021-12-21 17:36:03,943 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 775 transitions. Word has length 113 [2021-12-21 17:36:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:03,944 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 775 transitions. [2021-12-21 17:36:03,944 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-21 17:36:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 775 transitions. [2021-12-21 17:36:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-21 17:36:03,945 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:03,945 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-21 17:36:03,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 17:36:03,946 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-21 17:36:03,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:03,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1315263575, now seen corresponding path program 1 times [2021-12-21 17:36:03,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:03,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322636133] [2021-12-21 17:36:03,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:03,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 17:36:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 17:36:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 17:36:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-21 17:36:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 17:36:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 17:36:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-21 17:36:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:36:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-21 17:36:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-21 17:36:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-21 17:36:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:04,254 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-21 17:36:04,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:04,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322636133] [2021-12-21 17:36:04,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322636133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:04,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:04,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-21 17:36:04,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044972656] [2021-12-21 17:36:04,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:04,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-21 17:36:04,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:04,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-21 17:36:04,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-21 17:36:04,256 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-21 17:36:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:06,112 INFO L93 Difference]: Finished difference Result 1556 states and 1785 transitions. [2021-12-21 17:36:06,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 17:36:06,113 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-21 17:36:06,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:06,119 INFO L225 Difference]: With dead ends: 1556 [2021-12-21 17:36:06,120 INFO L226 Difference]: Without dead ends: 1317 [2021-12-21 17:36:06,122 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-21 17:36:06,123 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 1539 mSDsluCounter, 2122 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:06,123 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.5s Time] [2021-12-21 17:36:06,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2021-12-21 17:36:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 902. [2021-12-21 17:36:06,159 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-21 17:36:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1058 transitions. [2021-12-21 17:36:06,164 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1058 transitions. Word has length 114 [2021-12-21 17:36:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:06,165 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1058 transitions. [2021-12-21 17:36:06,165 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-21 17:36:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1058 transitions. [2021-12-21 17:36:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-21 17:36:06,166 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:06,167 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-21 17:36:06,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 17:36:06,167 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-21 17:36:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:06,167 INFO L85 PathProgramCache]: Analyzing trace with hash -331086751, now seen corresponding path program 1 times [2021-12-21 17:36:06,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:06,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833985271] [2021-12-21 17:36:06,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:06,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 17:36:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 17:36:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 17:36:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-21 17:36:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 17:36:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 17:36:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-21 17:36:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-21 17:36:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-21 17:36:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-21 17:36:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:06,447 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-21 17:36:06,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:06,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833985271] [2021-12-21 17:36:06,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833985271] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:06,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:06,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-21 17:36:06,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668130470] [2021-12-21 17:36:06,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:06,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 17:36:06,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:06,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 17:36:06,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-21 17:36:06,449 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-21 17:36:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:08,322 INFO L93 Difference]: Finished difference Result 1829 states and 2159 transitions. [2021-12-21 17:36:08,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 17:36:08,322 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-21 17:36:08,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:08,327 INFO L225 Difference]: With dead ends: 1829 [2021-12-21 17:36:08,328 INFO L226 Difference]: Without dead ends: 1329 [2021-12-21 17:36:08,329 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-21 17:36:08,329 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 846 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 2763 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:08,330 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.6s Time] [2021-12-21 17:36:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2021-12-21 17:36:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 887. [2021-12-21 17:36:08,372 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-21 17:36:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1031 transitions. [2021-12-21 17:36:08,383 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1031 transitions. Word has length 122 [2021-12-21 17:36:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:08,384 INFO L470 AbstractCegarLoop]: Abstraction has 887 states and 1031 transitions. [2021-12-21 17:36:08,384 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-21 17:36:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1031 transitions. [2021-12-21 17:36:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-21 17:36:08,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:08,388 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-21 17:36:08,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 17:36:08,388 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-21 17:36:08,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:08,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1688734875, now seen corresponding path program 1 times [2021-12-21 17:36:08,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:08,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470765432] [2021-12-21 17:36:08,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:08,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-21 17:36:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-21 17:36:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-21 17:36:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-21 17:36:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-21 17:36:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-21 17:36:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-21 17:36:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-21 17:36:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-21 17:36:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-21 17:36:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-21 17:36:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-21 17:36:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:08,997 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-21 17:36:08,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:08,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470765432] [2021-12-21 17:36:08,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470765432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:08,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:08,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-12-21 17:36:08,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559519006] [2021-12-21 17:36:08,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:08,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-21 17:36:08,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:08,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-21 17:36:08,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2021-12-21 17:36:08,999 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-21 17:36:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:11,369 INFO L93 Difference]: Finished difference Result 1361 states and 1599 transitions. [2021-12-21 17:36:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-21 17:36:11,370 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-21 17:36:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:11,373 INFO L225 Difference]: With dead ends: 1361 [2021-12-21 17:36:11,373 INFO L226 Difference]: Without dead ends: 659 [2021-12-21 17:36:11,374 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=2268, Unknown=0, NotChecked=0, Total=2550 [2021-12-21 17:36:11,375 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 855 mSDsluCounter, 5399 mSDsCounter, 0 mSdLazyCounter, 5098 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.9s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:11,375 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [887 Valid, 5825 Invalid, 5652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 5098 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-21 17:36:11,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-12-21 17:36:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 608. [2021-12-21 17:36:11,401 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-21 17:36:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 698 transitions. [2021-12-21 17:36:11,403 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 698 transitions. Word has length 117 [2021-12-21 17:36:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:11,403 INFO L470 AbstractCegarLoop]: Abstraction has 608 states and 698 transitions. [2021-12-21 17:36:11,404 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-21 17:36:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 698 transitions. [2021-12-21 17:36:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-21 17:36:11,405 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:11,405 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-21 17:36:11,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 17:36:11,405 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-21 17:36:11,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:11,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1120376943, now seen corresponding path program 1 times [2021-12-21 17:36:11,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:11,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564911127] [2021-12-21 17:36:11,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:11,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-21 17:36:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:36:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-21 17:36:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-21 17:36:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-21 17:36:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-21 17:36:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-21 17:36:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-21 17:36:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-21 17:36:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-21 17:36:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:11,904 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-21 17:36:11,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:11,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564911127] [2021-12-21 17:36:11,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564911127] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:36:11,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914315281] [2021-12-21 17:36:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:11,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:36:11,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:36:11,906 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-21 17:36:11,907 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-21 17:36:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:12,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-21 17:36:12,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:36:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-21 17:36:13,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 17:36:13,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914315281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:13,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 17:36:13,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [18] total 38 [2021-12-21 17:36:13,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40359758] [2021-12-21 17:36:13,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:13,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-21 17:36:13,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:13,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-21 17:36:13,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1317, Unknown=0, NotChecked=0, Total=1406 [2021-12-21 17:36:13,212 INFO L87 Difference]: Start difference. First operand 608 states and 698 transitions. Second operand has 23 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 18 states have internal predecessors, (67), 9 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) [2021-12-21 17:36:15,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:15,507 INFO L93 Difference]: Finished difference Result 1054 states and 1171 transitions. [2021-12-21 17:36:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-21 17:36:15,507 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 18 states have internal predecessors, (67), 9 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) Word has length 130 [2021-12-21 17:36:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:15,510 INFO L225 Difference]: With dead ends: 1054 [2021-12-21 17:36:15,510 INFO L226 Difference]: Without dead ends: 859 [2021-12-21 17:36:15,512 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=237, Invalid=2955, Unknown=0, NotChecked=0, Total=3192 [2021-12-21 17:36:15,512 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 970 mSDsluCounter, 5587 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 5909 SdHoareTripleChecker+Invalid, 3425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 720 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:15,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [975 Valid, 5909 Invalid, 3425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [720 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-21 17:36:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-12-21 17:36:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 664. [2021-12-21 17:36:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 428 states have (on average 1.1518691588785046) internal successors, (493), 460 states have internal predecessors, (493), 135 states have call successors, (135), 79 states have call predecessors, (135), 78 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) [2021-12-21 17:36:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 761 transitions. [2021-12-21 17:36:15,552 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 761 transitions. Word has length 130 [2021-12-21 17:36:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:15,553 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 761 transitions. [2021-12-21 17:36:15,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 18 states have internal predecessors, (67), 9 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) [2021-12-21 17:36:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 761 transitions. [2021-12-21 17:36:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-21 17:36:15,554 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:15,555 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] [2021-12-21 17:36:15,577 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-21 17:36:15,771 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-21 17:36:15,772 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-21 17:36:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1921822841, now seen corresponding path program 1 times [2021-12-21 17:36:15,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:15,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953017011] [2021-12-21 17:36:15,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:15,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:15,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-21 17:36:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-21 17:36:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-21 17:36:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-21 17:36:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-21 17:36:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-21 17:36:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-21 17:36:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-21 17:36:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-12-21 17:36:16,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:16,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953017011] [2021-12-21 17:36:16,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953017011] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:36:16,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51788226] [2021-12-21 17:36:16,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:16,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:36:16,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:36:16,204 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-21 17:36:16,232 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-21 17:36:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:16,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 1929 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-21 17:36:16,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:36:17,078 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 105 proven. 8 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-21 17:36:17,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:36:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-12-21 17:36:17,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51788226] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:36:17,720 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:36:17,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 33 [2021-12-21 17:36:17,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882298774] [2021-12-21 17:36:17,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:36:17,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-21 17:36:17,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:17,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-21 17:36:17,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2021-12-21 17:36:17,723 INFO L87 Difference]: Start difference. First operand 664 states and 761 transitions. Second operand has 33 states, 27 states have (on average 3.814814814814815) internal successors, (103), 23 states have internal predecessors, (103), 10 states have call successors, (40), 3 states have call predecessors, (40), 9 states have return successors, (41), 16 states have call predecessors, (41), 10 states have call successors, (41) [2021-12-21 17:36:19,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:19,819 INFO L93 Difference]: Finished difference Result 1270 states and 1451 transitions. [2021-12-21 17:36:19,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 17:36:19,820 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 3.814814814814815) internal successors, (103), 23 states have internal predecessors, (103), 10 states have call successors, (40), 3 states have call predecessors, (40), 9 states have return successors, (41), 16 states have call predecessors, (41), 10 states have call successors, (41) Word has length 138 [2021-12-21 17:36:19,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:19,822 INFO L225 Difference]: With dead ends: 1270 [2021-12-21 17:36:19,823 INFO L226 Difference]: Without dead ends: 651 [2021-12-21 17:36:19,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 292 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=193, Invalid=1787, Unknown=0, NotChecked=0, Total=1980 [2021-12-21 17:36:19,825 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 576 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 3565 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 2969 SdHoareTripleChecker+Invalid, 4056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 3565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:19,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 2969 Invalid, 4056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 3565 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-21 17:36:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-12-21 17:36:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 650. [2021-12-21 17:36:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 448 states have internal predecessors, (481), 131 states have call successors, (131), 78 states have call predecessors, (131), 77 states have return successors, (129), 125 states have call predecessors, (129), 129 states have call successors, (129) [2021-12-21 17:36:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 741 transitions. [2021-12-21 17:36:19,883 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 741 transitions. Word has length 138 [2021-12-21 17:36:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:19,883 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 741 transitions. [2021-12-21 17:36:19,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 3.814814814814815) internal successors, (103), 23 states have internal predecessors, (103), 10 states have call successors, (40), 3 states have call predecessors, (40), 9 states have return successors, (41), 16 states have call predecessors, (41), 10 states have call successors, (41) [2021-12-21 17:36:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 741 transitions. [2021-12-21 17:36:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-12-21 17:36:19,885 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:19,885 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] [2021-12-21 17:36:19,916 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-21 17:36:20,103 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,SelfDestructingSolverStorable10 [2021-12-21 17:36:20,103 INFO L402 AbstractCegarLoop]: === Iteration 12 === 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-21 17:36:20,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1252398581, now seen corresponding path program 1 times [2021-12-21 17:36:20,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:20,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522128425] [2021-12-21 17:36:20,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:20,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 17:36:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 17:36:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:36:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:36:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 17:36:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 17:36:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-21 17:36:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-21 17:36:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-21 17:36:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:20,297 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-21 17:36:20,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:20,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522128425] [2021-12-21 17:36:20,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522128425] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:20,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:20,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 17:36:20,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497984857] [2021-12-21 17:36:20,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:20,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 17:36:20,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 17:36:20,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 17:36:20,300 INFO L87 Difference]: Start difference. First operand 650 states and 741 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-21 17:36:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:20,886 INFO L93 Difference]: Finished difference Result 1062 states and 1200 transitions. [2021-12-21 17:36:20,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 17:36:20,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 149 [2021-12-21 17:36:20,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:20,892 INFO L225 Difference]: With dead ends: 1062 [2021-12-21 17:36:20,892 INFO L226 Difference]: Without dead ends: 1060 [2021-12-21 17:36:20,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-21 17:36:20,893 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 569 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:20,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [620 Valid, 921 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 17:36:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2021-12-21 17:36:20,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 748. [2021-12-21 17:36:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 484 states have (on average 1.1363636363636365) internal successors, (550), 514 states have internal predecessors, (550), 149 states have call successors, (149), 92 states have call predecessors, (149), 93 states have return successors, (151), 143 states have call predecessors, (151), 147 states have call successors, (151) [2021-12-21 17:36:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 850 transitions. [2021-12-21 17:36:20,961 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 850 transitions. Word has length 149 [2021-12-21 17:36:20,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:20,963 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 850 transitions. [2021-12-21 17:36:20,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-21 17:36:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 850 transitions. [2021-12-21 17:36:20,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-21 17:36:20,964 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:20,965 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, 1, 1] [2021-12-21 17:36:20,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 17:36:20,965 INFO L402 AbstractCegarLoop]: === Iteration 13 === 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-21 17:36:20,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:20,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1777528727, now seen corresponding path program 1 times [2021-12-21 17:36:20,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:20,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835102060] [2021-12-21 17:36:20,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:20,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 17:36:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 17:36:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:36:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:36:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 17:36:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 17:36:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-21 17:36:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 17:36:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-21 17:36:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-21 17:36:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-21 17:36:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-21 17:36:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-12-21 17:36:21,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:21,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835102060] [2021-12-21 17:36:21,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835102060] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:21,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:21,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 17:36:21,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364234884] [2021-12-21 17:36:21,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:21,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 17:36:21,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 17:36:21,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 17:36:21,158 INFO L87 Difference]: Start difference. First operand 748 states and 850 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-21 17:36:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:21,641 INFO L93 Difference]: Finished difference Result 748 states and 850 transitions. [2021-12-21 17:36:21,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 17:36:21,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2021-12-21 17:36:21,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:21,645 INFO L225 Difference]: With dead ends: 748 [2021-12-21 17:36:21,646 INFO L226 Difference]: Without dead ends: 746 [2021-12-21 17:36:21,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-21 17:36:21,646 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 803 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:21,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 776 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 17:36:21,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-12-21 17:36:21,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2021-12-21 17:36:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 483 states have (on average 1.1325051759834368) internal successors, (547), 512 states have internal predecessors, (547), 149 states have call successors, (149), 92 states have call predecessors, (149), 93 states have return successors, (151), 143 states have call predecessors, (151), 147 states have call successors, (151) [2021-12-21 17:36:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 847 transitions. [2021-12-21 17:36:21,712 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 847 transitions. Word has length 146 [2021-12-21 17:36:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:21,712 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 847 transitions. [2021-12-21 17:36:21,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-21 17:36:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 847 transitions. [2021-12-21 17:36:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-21 17:36:21,713 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:21,714 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-21 17:36:21,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 17:36:21,714 INFO L402 AbstractCegarLoop]: === Iteration 14 === 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-21 17:36:21,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:21,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1550649940, now seen corresponding path program 1 times [2021-12-21 17:36:21,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:21,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719692333] [2021-12-21 17:36:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:21,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 17:36:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 17:36:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:36:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:36:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 17:36:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 17:36:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-21 17:36:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-21 17:36:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-21 17:36:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-21 17:36:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:21,892 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-21 17:36:21,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719692333] [2021-12-21 17:36:21,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719692333] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:21,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:21,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 17:36:21,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428334035] [2021-12-21 17:36:21,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:21,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 17:36:21,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:21,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 17:36:21,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 17:36:21,896 INFO L87 Difference]: Start difference. First operand 746 states and 847 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-21 17:36:22,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:22,485 INFO L93 Difference]: Finished difference Result 756 states and 861 transitions. [2021-12-21 17:36:22,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 17:36:22,485 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-21 17:36:22,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:22,488 INFO L225 Difference]: With dead ends: 756 [2021-12-21 17:36:22,488 INFO L226 Difference]: Without dead ends: 754 [2021-12-21 17:36:22,489 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-21 17:36:22,489 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 636 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:22,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 1105 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 17:36:22,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-12-21 17:36:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 744. [2021-12-21 17:36:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 482 states have (on average 1.1224066390041494) internal successors, (541), 510 states have internal predecessors, (541), 149 states have call successors, (149), 92 states have call predecessors, (149), 93 states have return successors, (151), 143 states have call predecessors, (151), 147 states have call successors, (151) [2021-12-21 17:36:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 841 transitions. [2021-12-21 17:36:22,573 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 841 transitions. Word has length 154 [2021-12-21 17:36:22,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:22,573 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 841 transitions. [2021-12-21 17:36:22,573 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-21 17:36:22,574 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 841 transitions. [2021-12-21 17:36:22,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-21 17:36:22,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:22,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:36:22,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 17:36:22,576 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-21 17:36:22,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:22,576 INFO L85 PathProgramCache]: Analyzing trace with hash -608956573, now seen corresponding path program 1 times [2021-12-21 17:36:22,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:22,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601816975] [2021-12-21 17:36:22,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:22,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 17:36:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 17:36:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:36:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:36:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:22,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 17:36:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:23,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:23,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-21 17:36:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:23,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-21 17:36:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:23,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-21 17:36:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:23,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-21 17:36:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:23,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-21 17:36:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:23,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-21 17:36:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:23,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:23,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-21 17:36:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-12-21 17:36:23,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:23,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601816975] [2021-12-21 17:36:23,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601816975] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:36:23,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714973258] [2021-12-21 17:36:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:23,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:36:23,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:36:23,152 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-21 17:36:23,153 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-21 17:36:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:23,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 1952 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-21 17:36:23,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:36:24,306 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-21 17:36:24,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:36:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-12-21 17:36:25,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714973258] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:36:25,002 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:36:25,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 15] total 48 [2021-12-21 17:36:25,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487243843] [2021-12-21 17:36:25,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:36:25,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-21 17:36:25,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:25,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-21 17:36:25,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=2143, Unknown=0, NotChecked=0, Total=2256 [2021-12-21 17:36:25,004 INFO L87 Difference]: Start difference. First operand 744 states and 841 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, (63), 6 states have call predecessors, (63), 10 states have return successors, (65), 22 states have call predecessors, (65), 18 states have call successors, (65) [2021-12-21 17:36:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:30,219 INFO L93 Difference]: Finished difference Result 943 states and 1062 transitions. [2021-12-21 17:36:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-21 17:36:30,220 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, (63), 6 states have call predecessors, (63), 10 states have return successors, (65), 22 states have call predecessors, (65), 18 states have call successors, (65) Word has length 150 [2021-12-21 17:36:30,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:30,222 INFO L225 Difference]: With dead ends: 943 [2021-12-21 17:36:30,222 INFO L226 Difference]: Without dead ends: 694 [2021-12-21 17:36:30,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=587, Invalid=5733, Unknown=0, NotChecked=0, Total=6320 [2021-12-21 17:36:30,224 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 1662 mSDsluCounter, 3781 mSDsCounter, 0 mSdLazyCounter, 8527 mSolverCounterSat, 1253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 4082 SdHoareTripleChecker+Invalid, 9780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1253 IncrementalHoareTripleChecker+Valid, 8527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:30,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1664 Valid, 4082 Invalid, 9780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1253 Valid, 8527 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2021-12-21 17:36:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2021-12-21 17:36:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2021-12-21 17:36:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 447 states have (on average 1.1230425055928412) internal successors, (502), 477 states have internal predecessors, (502), 138 states have call successors, (138), 84 states have call predecessors, (138), 89 states have return successors, (144), 134 states have call predecessors, (144), 136 states have call successors, (144) [2021-12-21 17:36:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 784 transitions. [2021-12-21 17:36:30,330 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 784 transitions. Word has length 150 [2021-12-21 17:36:30,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:30,330 INFO L470 AbstractCegarLoop]: Abstraction has 694 states and 784 transitions. [2021-12-21 17:36:30,330 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, (63), 6 states have call predecessors, (63), 10 states have return successors, (65), 22 states have call predecessors, (65), 18 states have call successors, (65) [2021-12-21 17:36:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 784 transitions. [2021-12-21 17:36:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-21 17:36:30,332 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:30,332 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-21 17:36:30,353 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-21 17:36:30,553 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-21 17:36:30,554 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-21 17:36:30,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:30,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1422412358, now seen corresponding path program 1 times [2021-12-21 17:36:30,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:30,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634306214] [2021-12-21 17:36:30,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:30,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 17:36:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 17:36:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:36:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:36:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 17:36:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 17:36:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-21 17:36:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-21 17:36:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-21 17:36:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-21 17:36:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-21 17:36:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-21 17:36:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-21 17:36:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-21 17:36:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-21 17:36:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:30,750 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-21 17:36:30,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:30,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634306214] [2021-12-21 17:36:30,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634306214] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:30,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:30,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 17:36:30,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236424768] [2021-12-21 17:36:30,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:30,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 17:36:30,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:30,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 17:36:30,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-21 17:36:30,752 INFO L87 Difference]: Start difference. First operand 694 states and 784 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2021-12-21 17:36:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:31,782 INFO L93 Difference]: Finished difference Result 969 states and 1095 transitions. [2021-12-21 17:36:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 17:36:31,783 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 195 [2021-12-21 17:36:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:31,824 INFO L225 Difference]: With dead ends: 969 [2021-12-21 17:36:31,824 INFO L226 Difference]: Without dead ends: 699 [2021-12-21 17:36:31,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2021-12-21 17:36:31,826 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 774 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:31,826 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [801 Valid, 2045 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-21 17:36:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-12-21 17:36:31,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 672. [2021-12-21 17:36:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 435 states have (on average 1.1218390804597702) internal successors, (488), 462 states have internal predecessors, (488), 130 states have call successors, (130), 84 states have call predecessors, (130), 87 states have return successors, (133), 127 states have call predecessors, (133), 128 states have call successors, (133) [2021-12-21 17:36:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 751 transitions. [2021-12-21 17:36:31,944 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 751 transitions. Word has length 195 [2021-12-21 17:36:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:31,945 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 751 transitions. [2021-12-21 17:36:31,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2021-12-21 17:36:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 751 transitions. [2021-12-21 17:36:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-21 17:36:31,948 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:31,948 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-21 17:36:31,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 17:36:31,948 INFO L402 AbstractCegarLoop]: === Iteration 17 === 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-21 17:36:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1500690336, now seen corresponding path program 1 times [2021-12-21 17:36:31,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:31,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296095732] [2021-12-21 17:36:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:31,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 17:36:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 17:36:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:36:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:36:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 17:36:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 17:36:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-21 17:36:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-21 17:36:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-21 17:36:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-21 17:36:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-21 17:36:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-21 17:36:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-21 17:36:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-21 17:36:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-21 17:36:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-21 17:36:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:32,141 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-21 17:36:32,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:32,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296095732] [2021-12-21 17:36:32,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296095732] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:32,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:32,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 17:36:32,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117202368] [2021-12-21 17:36:32,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:32,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 17:36:32,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:32,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 17:36:32,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 17:36:32,143 INFO L87 Difference]: Start difference. First operand 672 states and 751 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-21 17:36:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:32,985 INFO L93 Difference]: Finished difference Result 711 states and 772 transitions. [2021-12-21 17:36:32,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 17:36:32,985 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-21 17:36:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:32,988 INFO L225 Difference]: With dead ends: 711 [2021-12-21 17:36:32,988 INFO L226 Difference]: Without dead ends: 709 [2021-12-21 17:36:32,988 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-21 17:36:32,989 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 1479 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:32,989 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.6s Time] [2021-12-21 17:36:32,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-12-21 17:36:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 670. [2021-12-21 17:36:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 434 states have (on average 1.119815668202765) internal successors, (486), 460 states have internal predecessors, (486), 130 states have call successors, (130), 84 states have call predecessors, (130), 87 states have return successors, (133), 127 states have call predecessors, (133), 128 states have call successors, (133) [2021-12-21 17:36:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 749 transitions. [2021-12-21 17:36:33,107 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 749 transitions. Word has length 201 [2021-12-21 17:36:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:33,107 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 749 transitions. [2021-12-21 17:36:33,107 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-21 17:36:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 749 transitions. [2021-12-21 17:36:33,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-21 17:36:33,109 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:33,109 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-21 17:36:33,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-21 17:36:33,109 INFO L402 AbstractCegarLoop]: === Iteration 18 === 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-21 17:36:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:33,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1991896125, now seen corresponding path program 1 times [2021-12-21 17:36:33,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:33,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813615584] [2021-12-21 17:36:33,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:33,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 17:36:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 17:36:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:36:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:36:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 17:36:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 17:36:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-21 17:36:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:33,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-21 17:36:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-21 17:36:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-21 17:36:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-21 17:36:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-21 17:36:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-21 17:36:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-21 17:36:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-21 17:36:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-21 17:36:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-21 17:36:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-12-21 17:36:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:33,327 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-21 17:36:33,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:33,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813615584] [2021-12-21 17:36:33,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813615584] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:33,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:33,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 17:36:33,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321265582] [2021-12-21 17:36:33,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:33,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 17:36:33,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 17:36:33,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-21 17:36:33,329 INFO L87 Difference]: Start difference. First operand 670 states and 749 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-21 17:36:33,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:33,954 INFO L93 Difference]: Finished difference Result 670 states and 749 transitions. [2021-12-21 17:36:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 17:36:33,955 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-21 17:36:33,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:33,957 INFO L225 Difference]: With dead ends: 670 [2021-12-21 17:36:33,957 INFO L226 Difference]: Without dead ends: 668 [2021-12-21 17:36:33,958 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-21 17:36:33,958 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.4s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:33,958 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.4s Time] [2021-12-21 17:36:33,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-12-21 17:36:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2021-12-21 17:36:34,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 433 states have (on average 1.115473441108545) internal successors, (483), 458 states have internal predecessors, (483), 130 states have call successors, (130), 84 states have call predecessors, (130), 87 states have return successors, (133), 127 states have call predecessors, (133), 128 states have call successors, (133) [2021-12-21 17:36:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 746 transitions. [2021-12-21 17:36:34,059 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 746 transitions. Word has length 208 [2021-12-21 17:36:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:34,059 INFO L470 AbstractCegarLoop]: Abstraction has 668 states and 746 transitions. [2021-12-21 17:36:34,059 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-21 17:36:34,059 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 746 transitions. [2021-12-21 17:36:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-12-21 17:36:34,061 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:34,061 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-21 17:36:34,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 17:36:34,062 INFO L402 AbstractCegarLoop]: === Iteration 19 === 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-21 17:36:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash 755592090, now seen corresponding path program 1 times [2021-12-21 17:36:34,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:34,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538815582] [2021-12-21 17:36:34,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:34,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 17:36:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 17:36:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:36:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:36:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 17:36:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 17:36:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-21 17:36:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-21 17:36:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-21 17:36:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-21 17:36:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-21 17:36:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-21 17:36:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-21 17:36:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-21 17:36:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-21 17:36:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-21 17:36:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:34,281 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-21 17:36:34,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:34,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538815582] [2021-12-21 17:36:34,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538815582] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:34,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 17:36:34,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 17:36:34,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361665959] [2021-12-21 17:36:34,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:34,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 17:36:34,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:34,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 17:36:34,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-21 17:36:34,284 INFO L87 Difference]: Start difference. First operand 668 states and 746 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-21 17:36:35,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:35,008 INFO L93 Difference]: Finished difference Result 668 states and 746 transitions. [2021-12-21 17:36:35,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 17:36:35,008 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-21 17:36:35,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:35,011 INFO L225 Difference]: With dead ends: 668 [2021-12-21 17:36:35,011 INFO L226 Difference]: Without dead ends: 666 [2021-12-21 17:36:35,014 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-21 17:36:35,015 INFO L933 BasicCegarLoop]: 341 mSDtfsCounter, 938 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:35,015 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.5s Time] [2021-12-21 17:36:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-12-21 17:36:35,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 666. [2021-12-21 17:36:35,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 432 states have (on average 1.1134259259259258) internal successors, (481), 456 states have internal predecessors, (481), 130 states have call successors, (130), 84 states have call predecessors, (130), 87 states have return successors, (133), 127 states have call predecessors, (133), 128 states have call successors, (133) [2021-12-21 17:36:35,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 744 transitions. [2021-12-21 17:36:35,116 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 744 transitions. Word has length 204 [2021-12-21 17:36:35,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:35,116 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 744 transitions. [2021-12-21 17:36:35,116 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-21 17:36:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 744 transitions. [2021-12-21 17:36:35,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-21 17:36:35,118 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:35,118 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-21 17:36:35,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-21 17:36:35,118 INFO L402 AbstractCegarLoop]: === Iteration 20 === 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-21 17:36:35,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash -600142417, now seen corresponding path program 1 times [2021-12-21 17:36:35,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:35,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829546562] [2021-12-21 17:36:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:35,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 17:36:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 17:36:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:36:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:36:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 17:36:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:35,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 17:36:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-21 17:36:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:35,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-21 17:36:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-21 17:36:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-21 17:36:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-21 17:36:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-21 17:36:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-21 17:36:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2021-12-21 17:36:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-21 17:36:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-21 17:36:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-21 17:36:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-12-21 17:36:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-12-21 17:36:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:35,663 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-21 17:36:35,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:35,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829546562] [2021-12-21 17:36:35,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829546562] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:36:35,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67790992] [2021-12-21 17:36:35,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:35,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:36:35,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:36:35,665 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-21 17:36:35,674 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-21 17:36:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:36,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 2096 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-21 17:36:36,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:36:36,594 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-21 17:36:36,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:36:37,301 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-21 17:36:37,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67790992] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:36:37,302 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:36:37,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 15] total 33 [2021-12-21 17:36:37,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744672482] [2021-12-21 17:36:37,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:36:37,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-21 17:36:37,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:37,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-21 17:36:37,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2021-12-21 17:36:37,304 INFO L87 Difference]: Start difference. First operand 666 states and 744 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) [2021-12-21 17:36:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:40,576 INFO L93 Difference]: Finished difference Result 1129 states and 1251 transitions. [2021-12-21 17:36:40,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-21 17:36:40,576 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 214 [2021-12-21 17:36:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:40,579 INFO L225 Difference]: With dead ends: 1129 [2021-12-21 17:36:40,579 INFO L226 Difference]: Without dead ends: 686 [2021-12-21 17:36:40,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 479 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=316, Invalid=2546, Unknown=0, NotChecked=0, Total=2862 [2021-12-21 17:36:40,581 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 1298 mSDsluCounter, 2596 mSDsCounter, 0 mSdLazyCounter, 5378 mSolverCounterSat, 1202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 6580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1202 IncrementalHoareTripleChecker+Valid, 5378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:40,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1298 Valid, 2905 Invalid, 6580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1202 Valid, 5378 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-12-21 17:36:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2021-12-21 17:36:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 664. [2021-12-21 17:36:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 431 states have (on average 1.1020881670533642) internal successors, (475), 454 states have internal predecessors, (475), 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-21 17:36:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 737 transitions. [2021-12-21 17:36:40,701 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 737 transitions. Word has length 214 [2021-12-21 17:36:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:40,702 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 737 transitions. [2021-12-21 17:36:40,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2021-12-21 17:36:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 737 transitions. [2021-12-21 17:36:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2021-12-21 17:36:40,704 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:40,704 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] [2021-12-21 17:36:40,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-21 17:36:40,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:36:40,923 INFO L402 AbstractCegarLoop]: === Iteration 21 === 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-21 17:36:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:40,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2038632069, now seen corresponding path program 1 times [2021-12-21 17:36:40,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:40,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885363665] [2021-12-21 17:36:40,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:40,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 17:36:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 17:36:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:36:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:36:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 17:36:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 17:36:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-21 17:36:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-21 17:36:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-21 17:36:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-21 17:36:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-21 17:36:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-21 17:36:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-21 17:36:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-21 17:36:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-21 17:36:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2021-12-21 17:36:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2021-12-21 17:36:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2021-12-21 17:36:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2021-12-21 17:36:41,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:41,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885363665] [2021-12-21 17:36:41,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885363665] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:36:41,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650967595] [2021-12-21 17:36:41,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:41,148 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:36:41,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:36:41,149 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 17:36:41,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 17:36:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:41,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 2070 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-21 17:36:41,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:36:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2021-12-21 17:36:41,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 17:36:41,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650967595] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 17:36:41,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 17:36:41,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 24 [2021-12-21 17:36:41,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517750740] [2021-12-21 17:36:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 17:36:41,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-21 17:36:41,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:41,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-21 17:36:41,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2021-12-21 17:36:41,765 INFO L87 Difference]: Start difference. First operand 664 states and 737 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) [2021-12-21 17:36:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 17:36:42,193 INFO L93 Difference]: Finished difference Result 821 states and 894 transitions. [2021-12-21 17:36:42,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 17:36:42,193 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) Word has length 209 [2021-12-21 17:36:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 17:36:42,195 INFO L225 Difference]: With dead ends: 821 [2021-12-21 17:36:42,196 INFO L226 Difference]: Without dead ends: 666 [2021-12-21 17:36:42,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2021-12-21 17:36:42,197 INFO L933 BasicCegarLoop]: 368 mSDtfsCounter, 141 mSDsluCounter, 4438 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 4806 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 17:36:42,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 4806 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 17:36:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-12-21 17:36:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2021-12-21 17:36:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 431 states have (on average 1.099767981438515) internal successors, (474), 454 states have internal predecessors, (474), 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-21 17:36:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 736 transitions. [2021-12-21 17:36:42,340 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 736 transitions. Word has length 209 [2021-12-21 17:36:42,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 17:36:42,340 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 736 transitions. [2021-12-21 17:36:42,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) [2021-12-21 17:36:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 736 transitions. [2021-12-21 17:36:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2021-12-21 17:36:42,342 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 17:36:42,342 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 17:36:42,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-21 17:36:42,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:36:42,551 INFO L402 AbstractCegarLoop]: === Iteration 22 === 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-21 17:36:42,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 17:36:42,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2056655727, now seen corresponding path program 1 times [2021-12-21 17:36:42,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 17:36:42,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717444242] [2021-12-21 17:36:42,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:42,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 17:36:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-21 17:36:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-21 17:36:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 17:36:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 17:36:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-21 17:36:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-21 17:36:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 17:36:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-21 17:36:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-21 17:36:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-21 17:36:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-21 17:36:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-21 17:36:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-21 17:36:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-21 17:36:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-21 17:36:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-21 17:36:42,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:42,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-21 17:36:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-21 17:36:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-21 17:36:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2021-12-21 17:36:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2021-12-21 17:36:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-21 17:36:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 17:36:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-21 17:36:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-21 17:36:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2021-12-21 17:36:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2021-12-21 17:36:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2021-12-21 17:36:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2021-12-21 17:36:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,224 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 10 proven. 34 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2021-12-21 17:36:43,224 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 17:36:43,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717444242] [2021-12-21 17:36:43,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717444242] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 17:36:43,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220961995] [2021-12-21 17:36:43,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 17:36:43,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 17:36:43,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 17:36:43,236 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 17:36:43,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 17:36:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 17:36:43,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 2134 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-21 17:36:43,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 17:36:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 169 proven. 4 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-21 17:36:44,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 17:36:45,392 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2021-12-21 17:36:45,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220961995] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 17:36:45,393 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 17:36:45,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 16] total 48 [2021-12-21 17:36:45,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335192240] [2021-12-21 17:36:45,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 17:36:45,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-21 17:36:45,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 17:36:45,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-21 17:36:45,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2129, Unknown=0, NotChecked=0, Total=2256 [2021-12-21 17:36:45,395 INFO L87 Difference]: Start difference. First operand 664 states and 736 transitions. Second operand has 48 states, 44 states have (on average 4.795454545454546) internal successors, (211), 35 states have internal predecessors, (211), 16 states have call successors, (79), 7 states have call predecessors, (79), 12 states have return successors, (78), 21 states have call predecessors, (78), 16 states have call successors, (78)