./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 6c24879c 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-?-6c24879 [2022-07-12 16:56:36,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 16:56:36,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 16:56:36,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 16:56:36,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 16:56:36,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 16:56:36,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 16:56:36,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 16:56:36,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 16:56:36,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 16:56:36,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 16:56:36,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 16:56:36,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 16:56:36,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 16:56:36,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 16:56:36,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 16:56:36,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 16:56:36,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 16:56:36,187 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 16:56:36,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 16:56:36,192 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 16:56:36,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 16:56:36,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 16:56:36,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 16:56:36,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 16:56:36,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 16:56:36,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 16:56:36,202 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 16:56:36,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 16:56:36,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 16:56:36,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 16:56:36,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 16:56:36,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 16:56:36,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 16:56:36,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 16:56:36,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 16:56:36,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 16:56:36,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 16:56:36,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 16:56:36,209 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 16:56:36,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 16:56:36,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 16:56:36,213 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 16:56:36,241 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 16:56:36,241 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 16:56:36,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 16:56:36,242 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 16:56:36,242 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 16:56:36,243 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 16:56:36,243 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 16:56:36,243 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 16:56:36,243 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 16:56:36,244 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 16:56:36,244 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 16:56:36,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 16:56:36,245 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 16:56:36,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 16:56:36,245 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 16:56:36,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 16:56:36,245 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 16:56:36,245 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 16:56:36,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 16:56:36,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 16:56:36,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 16:56:36,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:56:36,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 16:56:36,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 16:56:36,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 16:56:36,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 16:56:36,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 16:56:36,247 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 16:56:36,247 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 16:56:36,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 16:56:36,248 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 [2022-07-12 16:56:36,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 16:56:36,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 16:56:36,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 16:56:36,486 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 16:56:36,487 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 16:56:36,488 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 [2022-07-12 16:56:36,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e8a912c8/c1b4ad55b3114d94a8c85daa9860694f/FLAG57564481b [2022-07-12 16:56:37,091 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 16:56:37,091 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 [2022-07-12 16:56:37,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e8a912c8/c1b4ad55b3114d94a8c85daa9860694f/FLAG57564481b [2022-07-12 16:56:37,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e8a912c8/c1b4ad55b3114d94a8c85daa9860694f [2022-07-12 16:56:37,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 16:56:37,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 16:56:37,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 16:56:37,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 16:56:37,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 16:56:37,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:56:37" (1/1) ... [2022-07-12 16:56:37,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4922ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:37, skipping insertion in model container [2022-07-12 16:56:37,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:56:37" (1/1) ... [2022-07-12 16:56:37,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 16:56:37,374 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 16:56:38,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,928 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,935 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,937 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,940 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,942 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,948 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:38,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:56:38,977 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 16:56:39,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,179 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,179 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293452,293465] [2022-07-12 16:56:39,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293594,293607] [2022-07-12 16:56:39,183 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293743,293756] [2022-07-12 16:56:39,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293882,293895] [2022-07-12 16:56:39,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294037,294050] [2022-07-12 16:56:39,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294197,294210] [2022-07-12 16:56:39,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294348,294361] [2022-07-12 16:56:39,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294499,294512] [2022-07-12 16:56:39,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294651,294664] [2022-07-12 16:56:39,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294800,294813] [2022-07-12 16:56:39,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294948,294961] [2022-07-12 16:56:39,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2022-07-12 16:56:39,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2022-07-12 16:56:39,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295410,295423] [2022-07-12 16:56:39,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295563,295576] [2022-07-12 16:56:39,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2022-07-12 16:56:39,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2022-07-12 16:56:39,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2022-07-12 16:56:39,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2022-07-12 16:56:39,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2022-07-12 16:56:39,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2022-07-12 16:56:39,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2022-07-12 16:56:39,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2022-07-12 16:56:39,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2022-07-12 16:56:39,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2022-07-12 16:56:39,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2022-07-12 16:56:39,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2022-07-12 16:56:39,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2022-07-12 16:56:39,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2022-07-12 16:56:39,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2022-07-12 16:56:39,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2022-07-12 16:56:39,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2022-07-12 16:56:39,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2022-07-12 16:56:39,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2022-07-12 16:56:39,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2022-07-12 16:56:39,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2022-07-12 16:56:39,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2022-07-12 16:56:39,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2022-07-12 16:56:39,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2022-07-12 16:56:39,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2022-07-12 16:56:39,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2022-07-12 16:56:39,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2022-07-12 16:56:39,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2022-07-12 16:56:39,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2022-07-12 16:56:39,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2022-07-12 16:56:39,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2022-07-12 16:56:39,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2022-07-12 16:56:39,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2022-07-12 16:56:39,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2022-07-12 16:56:39,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2022-07-12 16:56:39,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2022-07-12 16:56:39,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2022-07-12 16:56:39,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2022-07-12 16:56:39,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2022-07-12 16:56:39,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2022-07-12 16:56:39,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2022-07-12 16:56:39,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2022-07-12 16:56:39,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2022-07-12 16:56:39,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2022-07-12 16:56:39,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2022-07-12 16:56:39,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2022-07-12 16:56:39,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2022-07-12 16:56:39,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2022-07-12 16:56:39,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2022-07-12 16:56:39,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2022-07-12 16:56:39,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2022-07-12 16:56:39,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/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] [2022-07-12 16:56:39,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:56:39,334 INFO L208 MainTranslator]: Completed translation [2022-07-12 16:56:39,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:39 WrapperNode [2022-07-12 16:56:39,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 16:56:39,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 16:56:39,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 16:56:39,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 16:56:39,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:39" (1/1) ... [2022-07-12 16:56:39,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:39" (1/1) ... [2022-07-12 16:56:39,474 INFO L137 Inliner]: procedures = 519, calls = 1770, calls flagged for inlining = 206, calls inlined = 55, statements flattened = 940 [2022-07-12 16:56:39,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 16:56:39,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 16:56:39,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 16:56:39,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 16:56:39,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:39" (1/1) ... [2022-07-12 16:56:39,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:39" (1/1) ... [2022-07-12 16:56:39,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:39" (1/1) ... [2022-07-12 16:56:39,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:39" (1/1) ... [2022-07-12 16:56:39,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:39" (1/1) ... [2022-07-12 16:56:39,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:39" (1/1) ... [2022-07-12 16:56:39,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:39" (1/1) ... [2022-07-12 16:56:39,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 16:56:39,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 16:56:39,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 16:56:39,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 16:56:39,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:39" (1/1) ... [2022-07-12 16:56:39,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:56:39,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:56:39,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 16:56:39,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 16:56:39,619 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_usb_gadget__class_registration_with_usb_gadget [2022-07-12 16:56:39,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_usb_gadget__class_registration_with_usb_gadget [2022-07-12 16:56:39,619 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-12 16:56:39,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-12 16:56:39,619 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:56:39,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:56:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 16:56:39,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 16:56:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:56:39,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:56:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:56:39,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:56:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:56:39,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:56:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 16:56:39,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 16:56:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:56:39,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:56:39,622 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:56:39,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:56:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 16:56:39,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 16:56:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:56:39,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:56:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 16:56:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:56:39,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:56:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:56:39,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:56:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_fs_char_dev__double_registration [2022-07-12 16:56:39,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_fs_char_dev__double_registration [2022-07-12 16:56:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:56:39,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:56:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:56:39,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:56:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 16:56:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 16:56:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 16:56:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 16:56:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:56:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:56:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 16:56:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 16:56:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-12 16:56:39,638 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-12 16:56:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 16:56:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 16:56:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_destroy_class [2022-07-12 16:56:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_destroy_class [2022-07-12 16:56:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:56:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:56:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:56:39,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:56:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:56:39,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:56:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_drivers_base_class__double_registration [2022-07-12 16:56:39,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_drivers_base_class__double_registration [2022-07-12 16:56:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_destroy_class [2022-07-12 16:56:39,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_destroy_class [2022-07-12 16:56:39,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 16:56:39,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:56:39,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:56:39,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 16:56:39,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 16:56:39,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:56:39,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:56:39,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:56:39,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:56:39,641 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:56:39,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:56:39,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:56:39,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:56:39,642 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 16:56:39,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 16:56:39,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:56:39,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:56:39,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:56:39,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:56:39,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 16:56:39,645 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadget [2022-07-12 16:56:39,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadget [2022-07-12 16:56:39,856 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 16:56:39,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 16:56:39,933 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 16:56:40,409 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 16:56:40,417 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 16:56:40,417 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 16:56:40,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:56:40 BoogieIcfgContainer [2022-07-12 16:56:40,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 16:56:40,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 16:56:40,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 16:56:40,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 16:56:40,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:56:37" (1/3) ... [2022-07-12 16:56:40,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31771bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:56:40, skipping insertion in model container [2022-07-12 16:56:40,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:39" (2/3) ... [2022-07-12 16:56:40,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31771bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:56:40, skipping insertion in model container [2022-07-12 16:56:40,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:56:40" (3/3) ... [2022-07-12 16:56:40,425 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2022-07-12 16:56:40,435 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 16:56:40,435 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-12 16:56:40,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 16:56:40,475 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@378a2610, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@412e68fd [2022-07-12 16:56:40,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-12 16:56:40,480 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) [2022-07-12 16:56:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 16:56:40,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:40,488 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:56:40,489 INFO L420 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)] === [2022-07-12 16:56:40,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:40,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1456749468, now seen corresponding path program 1 times [2022-07-12 16:56:40,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:40,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026651154] [2022-07-12 16:56:40,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:40,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:40,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:40,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:56:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:40,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:40,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:56:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:40,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:56:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 16:56:40,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:40,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026651154] [2022-07-12 16:56:40,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026651154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:40,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:40,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:40,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3965694] [2022-07-12 16:56:40,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:40,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:40,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:40,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:40,926 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) [2022-07-12 16:56:42,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:42,160 INFO L93 Difference]: Finished difference Result 1054 states and 1373 transitions. [2022-07-12 16:56:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:42,162 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 [2022-07-12 16:56:42,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:42,172 INFO L225 Difference]: With dead ends: 1054 [2022-07-12 16:56:42,173 INFO L226 Difference]: Without dead ends: 691 [2022-07-12 16:56:42,178 INFO L412 NwaCegarLoop]: 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 [2022-07-12 16:56:42,180 INFO L413 NwaCegarLoop]: 752 mSDtfsCounter, 539 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:42,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1491 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 16:56:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-07-12 16:56:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 480. [2022-07-12 16:56:42,257 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) [2022-07-12 16:56:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 557 transitions. [2022-07-12 16:56:42,263 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 557 transitions. Word has length 35 [2022-07-12 16:56:42,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:42,264 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 557 transitions. [2022-07-12 16:56:42,264 INFO L496 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) [2022-07-12 16:56:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 557 transitions. [2022-07-12 16:56:42,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 16:56:42,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:42,266 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:56:42,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 16:56:42,267 INFO L420 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)] === [2022-07-12 16:56:42,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:42,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1101797720, now seen corresponding path program 1 times [2022-07-12 16:56:42,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:42,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124009254] [2022-07-12 16:56:42,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:42,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:42,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:42,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:56:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:42,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:42,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:56:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:56:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:42,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:42,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:56:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 16:56:42,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:42,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124009254] [2022-07-12 16:56:42,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124009254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:42,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:42,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:42,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081721640] [2022-07-12 16:56:42,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:42,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:42,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:42,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:42,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:42,455 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) [2022-07-12 16:56:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:42,916 INFO L93 Difference]: Finished difference Result 482 states and 559 transitions. [2022-07-12 16:56:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 16:56:42,917 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 [2022-07-12 16:56:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:42,924 INFO L225 Difference]: With dead ends: 482 [2022-07-12 16:56:42,924 INFO L226 Difference]: Without dead ends: 480 [2022-07-12 16:56:42,925 INFO L412 NwaCegarLoop]: 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 [2022-07-12 16:56:42,926 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 508 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:42,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 743 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:56:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-07-12 16:56:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2022-07-12 16:56:42,957 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) [2022-07-12 16:56:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 554 transitions. [2022-07-12 16:56:42,961 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 554 transitions. Word has length 48 [2022-07-12 16:56:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:42,962 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 554 transitions. [2022-07-12 16:56:42,962 INFO L496 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) [2022-07-12 16:56:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 554 transitions. [2022-07-12 16:56:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 16:56:42,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:42,971 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:56:42,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 16:56:42,972 INFO L420 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)] === [2022-07-12 16:56:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:42,972 INFO L85 PathProgramCache]: Analyzing trace with hash 951373245, now seen corresponding path program 1 times [2022-07-12 16:56:42,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:42,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063156964] [2022-07-12 16:56:42,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:42,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:56:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:56:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:56:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:56:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 16:56:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 16:56:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:56:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-12 16:56:43,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:43,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063156964] [2022-07-12 16:56:43,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063156964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:43,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:43,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722967193] [2022-07-12 16:56:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:43,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:43,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:43,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:43,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:43,223 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) [2022-07-12 16:56:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:43,949 INFO L93 Difference]: Finished difference Result 821 states and 930 transitions. [2022-07-12 16:56:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:43,950 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 [2022-07-12 16:56:43,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:43,954 INFO L225 Difference]: With dead ends: 821 [2022-07-12 16:56:43,954 INFO L226 Difference]: Without dead ends: 819 [2022-07-12 16:56:43,954 INFO L412 NwaCegarLoop]: 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 [2022-07-12 16:56:43,955 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 632 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:43,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 918 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 16:56:43,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-07-12 16:56:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 672. [2022-07-12 16:56:43,998 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) [2022-07-12 16:56:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 785 transitions. [2022-07-12 16:56:44,001 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 785 transitions. Word has length 86 [2022-07-12 16:56:44,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:44,001 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 785 transitions. [2022-07-12 16:56:44,002 INFO L496 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) [2022-07-12 16:56:44,002 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 785 transitions. [2022-07-12 16:56:44,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 16:56:44,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:44,003 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:56:44,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 16:56:44,004 INFO L420 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)] === [2022-07-12 16:56:44,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash -292723993, now seen corresponding path program 1 times [2022-07-12 16:56:44,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:44,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745303396] [2022-07-12 16:56:44,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:44,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:56:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:56:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:56:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:56:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 16:56:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 16:56:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:56:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:56:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-12 16:56:44,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:44,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745303396] [2022-07-12 16:56:44,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745303396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:44,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:44,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:44,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964167236] [2022-07-12 16:56:44,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:44,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:44,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:44,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:44,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:44,228 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) [2022-07-12 16:56:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:44,657 INFO L93 Difference]: Finished difference Result 674 states and 787 transitions. [2022-07-12 16:56:44,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 16:56:44,658 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 [2022-07-12 16:56:44,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:44,661 INFO L225 Difference]: With dead ends: 674 [2022-07-12 16:56:44,661 INFO L226 Difference]: Without dead ends: 672 [2022-07-12 16:56:44,661 INFO L412 NwaCegarLoop]: 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 [2022-07-12 16:56:44,662 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 487 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:44,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 739 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:56:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-07-12 16:56:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 670. [2022-07-12 16:56:44,705 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) [2022-07-12 16:56:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 781 transitions. [2022-07-12 16:56:44,708 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 781 transitions. Word has length 105 [2022-07-12 16:56:44,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:44,711 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 781 transitions. [2022-07-12 16:56:44,711 INFO L496 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) [2022-07-12 16:56:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 781 transitions. [2022-07-12 16:56:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 16:56:44,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:44,717 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:56:44,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 16:56:44,717 INFO L420 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)] === [2022-07-12 16:56:44,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash -876569357, now seen corresponding path program 1 times [2022-07-12 16:56:44,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:44,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694531998] [2022-07-12 16:56:44,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:44,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:56:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:56:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:56:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:56:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 16:56:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 16:56:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:56:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:56:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 16:56:44,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:44,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694531998] [2022-07-12 16:56:44,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694531998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:44,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:44,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 16:56:44,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329800820] [2022-07-12 16:56:44,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:44,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 16:56:44,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:44,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 16:56:44,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 16:56:44,901 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) [2022-07-12 16:56:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:45,420 INFO L93 Difference]: Finished difference Result 672 states and 783 transitions. [2022-07-12 16:56:45,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 16:56:45,421 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 [2022-07-12 16:56:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:45,423 INFO L225 Difference]: With dead ends: 672 [2022-07-12 16:56:45,424 INFO L226 Difference]: Without dead ends: 670 [2022-07-12 16:56:45,424 INFO L412 NwaCegarLoop]: 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 [2022-07-12 16:56:45,424 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 838 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:45,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 717 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:56:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-07-12 16:56:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2022-07-12 16:56:45,452 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) [2022-07-12 16:56:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 778 transitions. [2022-07-12 16:56:45,455 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 778 transitions. Word has length 107 [2022-07-12 16:56:45,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:45,455 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 778 transitions. [2022-07-12 16:56:45,455 INFO L496 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) [2022-07-12 16:56:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 778 transitions. [2022-07-12 16:56:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 16:56:45,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:45,457 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:56:45,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 16:56:45,457 INFO L420 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)] === [2022-07-12 16:56:45,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1725971280, now seen corresponding path program 1 times [2022-07-12 16:56:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:45,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178546696] [2022-07-12 16:56:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:56:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:56:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:56:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:56:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 16:56:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 16:56:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:56:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:56:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:56:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 16:56:45,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:45,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178546696] [2022-07-12 16:56:45,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178546696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:45,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:45,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 16:56:45,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88678718] [2022-07-12 16:56:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:45,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 16:56:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:45,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 16:56:45,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 16:56:45,639 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) [2022-07-12 16:56:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:46,135 INFO L93 Difference]: Finished difference Result 670 states and 780 transitions. [2022-07-12 16:56:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 16:56:46,135 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 [2022-07-12 16:56:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:46,138 INFO L225 Difference]: With dead ends: 670 [2022-07-12 16:56:46,138 INFO L226 Difference]: Without dead ends: 668 [2022-07-12 16:56:46,139 INFO L412 NwaCegarLoop]: 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 [2022-07-12 16:56:46,139 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 830 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:46,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 715 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:56:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-07-12 16:56:46,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2022-07-12 16:56:46,172 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) [2022-07-12 16:56:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 775 transitions. [2022-07-12 16:56:46,175 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 775 transitions. Word has length 113 [2022-07-12 16:56:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:46,175 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 775 transitions. [2022-07-12 16:56:46,175 INFO L496 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) [2022-07-12 16:56:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 775 transitions. [2022-07-12 16:56:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 16:56:46,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:46,177 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:56:46,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 16:56:46,177 INFO L420 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)] === [2022-07-12 16:56:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1315263575, now seen corresponding path program 1 times [2022-07-12 16:56:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:46,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963766260] [2022-07-12 16:56:46,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:46,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:56:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:56:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:56:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:56:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 16:56:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 16:56:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:56:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:56:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 16:56:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 16:56:46,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:46,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963766260] [2022-07-12 16:56:46,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963766260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:46,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:46,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 16:56:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915005748] [2022-07-12 16:56:46,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:46,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 16:56:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:46,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 16:56:46,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-12 16:56:46,490 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) [2022-07-12 16:56:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:48,627 INFO L93 Difference]: Finished difference Result 1556 states and 1785 transitions. [2022-07-12 16:56:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 16:56:48,632 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 [2022-07-12 16:56:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:48,637 INFO L225 Difference]: With dead ends: 1556 [2022-07-12 16:56:48,637 INFO L226 Difference]: Without dead ends: 1317 [2022-07-12 16:56:48,638 INFO L412 NwaCegarLoop]: 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 [2022-07-12 16:56:48,638 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 1539 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 3608 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 4476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 3608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:48,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 1739 Invalid, 4476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 3608 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-12 16:56:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2022-07-12 16:56:48,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 902. [2022-07-12 16:56:48,669 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) [2022-07-12 16:56:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1058 transitions. [2022-07-12 16:56:48,673 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1058 transitions. Word has length 114 [2022-07-12 16:56:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:48,673 INFO L495 AbstractCegarLoop]: Abstraction has 902 states and 1058 transitions. [2022-07-12 16:56:48,673 INFO L496 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) [2022-07-12 16:56:48,674 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1058 transitions. [2022-07-12 16:56:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 16:56:48,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:48,675 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:56:48,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 16:56:48,676 INFO L420 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)] === [2022-07-12 16:56:48,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash -331086751, now seen corresponding path program 1 times [2022-07-12 16:56:48,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:48,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512670845] [2022-07-12 16:56:48,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:48,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:56:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:56:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:56:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:56:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 16:56:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 16:56:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:56:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:56:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:56:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 16:56:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-12 16:56:48,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:48,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512670845] [2022-07-12 16:56:48,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512670845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:48,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:48,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 16:56:48,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785789584] [2022-07-12 16:56:48,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:48,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 16:56:48,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:48,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 16:56:48,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-12 16:56:48,946 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) [2022-07-12 16:56:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:51,056 INFO L93 Difference]: Finished difference Result 1829 states and 2159 transitions. [2022-07-12 16:56:51,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 16:56:51,056 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 [2022-07-12 16:56:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:51,062 INFO L225 Difference]: With dead ends: 1829 [2022-07-12 16:56:51,063 INFO L226 Difference]: Without dead ends: 1329 [2022-07-12 16:56:51,064 INFO L412 NwaCegarLoop]: 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 [2022-07-12 16:56:51,064 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 846 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 4298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:51,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 2357 Invalid, 4298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 16:56:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-12 16:56:51,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 887. [2022-07-12 16:56:51,106 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) [2022-07-12 16:56:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1031 transitions. [2022-07-12 16:56:51,110 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1031 transitions. Word has length 122 [2022-07-12 16:56:51,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:51,110 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 1031 transitions. [2022-07-12 16:56:51,111 INFO L496 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) [2022-07-12 16:56:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1031 transitions. [2022-07-12 16:56:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 16:56:51,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:51,113 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:56:51,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 16:56:51,114 INFO L420 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)] === [2022-07-12 16:56:51,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1688734875, now seen corresponding path program 1 times [2022-07-12 16:56:51,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:51,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225967766] [2022-07-12 16:56:51,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:51,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:56:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:51,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:56:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:56:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:51,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:56:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 16:56:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 16:56:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:56:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:56:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:56:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 16:56:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 16:56:51,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:51,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225967766] [2022-07-12 16:56:51,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225967766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:51,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:51,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-12 16:56:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541619851] [2022-07-12 16:56:51,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:51,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 16:56:51,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 16:56:51,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-07-12 16:56:51,549 INFO L87 Difference]: Start difference. First operand 887 states and 1031 transitions. Second operand has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-12 16:56:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:54,465 INFO L93 Difference]: Finished difference Result 1504 states and 1714 transitions. [2022-07-12 16:56:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 16:56:54,466 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 117 [2022-07-12 16:56:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:54,470 INFO L225 Difference]: With dead ends: 1504 [2022-07-12 16:56:54,470 INFO L226 Difference]: Without dead ends: 1199 [2022-07-12 16:56:54,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=1519, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 16:56:54,472 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 1859 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 4699 mSolverCounterSat, 1077 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1869 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 5776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1077 IncrementalHoareTripleChecker+Valid, 4699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:54,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1869 Valid, 2156 Invalid, 5776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1077 Valid, 4699 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-12 16:56:54,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2022-07-12 16:56:54,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 883. [2022-07-12 16:56:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 571 states have (on average 1.148861646234676) internal successors, (656), 612 states have internal predecessors, (656), 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) [2022-07-12 16:56:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1025 transitions. [2022-07-12 16:56:54,536 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1025 transitions. Word has length 117 [2022-07-12 16:56:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:54,537 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1025 transitions. [2022-07-12 16:56:54,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-12 16:56:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1025 transitions. [2022-07-12 16:56:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 16:56:54,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:54,539 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1] [2022-07-12 16:56:54,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 16:56:54,540 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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)] === [2022-07-12 16:56:54,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1438984896, now seen corresponding path program 1 times [2022-07-12 16:56:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:54,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062761471] [2022-07-12 16:56:54,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:56:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:56:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:56:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 16:56:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 16:56:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 16:56:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:56:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:56:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:56:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:56:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:56:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-12 16:56:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:54,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062761471] [2022-07-12 16:56:54,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062761471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:54,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:54,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206428384] [2022-07-12 16:56:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:54,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:54,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:54,695 INFO L87 Difference]: Start difference. First operand 883 states and 1025 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:56:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:55,148 INFO L93 Difference]: Finished difference Result 897 states and 1046 transitions. [2022-07-12 16:56:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:55,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 127 [2022-07-12 16:56:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:55,152 INFO L225 Difference]: With dead ends: 897 [2022-07-12 16:56:55,152 INFO L226 Difference]: Without dead ends: 895 [2022-07-12 16:56:55,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:55,153 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 643 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:55,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 642 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:56:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-07-12 16:56:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 881. [2022-07-12 16:56:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 570 states have (on average 1.1403508771929824) internal successors, (650), 610 states have internal predecessors, (650), 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) [2022-07-12 16:56:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1019 transitions. [2022-07-12 16:56:55,206 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1019 transitions. Word has length 127 [2022-07-12 16:56:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:55,206 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1019 transitions. [2022-07-12 16:56:55,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:56:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1019 transitions. [2022-07-12 16:56:55,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 16:56:55,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:55,208 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:56:55,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 16:56:55,209 INFO L420 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)] === [2022-07-12 16:56:55,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1921822841, now seen corresponding path program 1 times [2022-07-12 16:56:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:55,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263216207] [2022-07-12 16:56:55,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:56:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:56:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:56:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:56:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:56:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:56:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 16:56:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:56:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 16:56:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:56:55,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:56:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 16:56:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:56:55,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:56:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-12 16:56:55,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:55,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263216207] [2022-07-12 16:56:55,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263216207] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:56:55,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101368514] [2022-07-12 16:56:55,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:55,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:56:55,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:56:55,706 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) [2022-07-12 16:56:55,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 16:56:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:56,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 1929 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-12 16:56:56,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:56:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 105 proven. 8 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-12 16:56:56,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 16:56:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-12 16:56:56,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101368514] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 16:56:56,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 16:56:56,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 31 [2022-07-12 16:56:56,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568797662] [2022-07-12 16:56:56,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 16:56:56,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 16:56:56,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:56,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 16:56:56,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-07-12 16:56:56,968 INFO L87 Difference]: Start difference. First operand 881 states and 1019 transitions. Second operand has 31 states, 25 states have (on average 3.88) internal successors, (97), 22 states have internal predecessors, (97), 10 states have call successors, (38), 3 states have call predecessors, (38), 9 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) [2022-07-12 16:56:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:59,428 INFO L93 Difference]: Finished difference Result 1691 states and 1940 transitions. [2022-07-12 16:56:59,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 16:56:59,429 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 3.88) internal successors, (97), 22 states have internal predecessors, (97), 10 states have call successors, (38), 3 states have call predecessors, (38), 9 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) Word has length 138 [2022-07-12 16:56:59,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:59,432 INFO L225 Difference]: With dead ends: 1691 [2022-07-12 16:56:59,432 INFO L226 Difference]: Without dead ends: 883 [2022-07-12 16:56:59,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 297 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1546, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 16:56:59,435 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 520 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 4332 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 4764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 4332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:59,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 2328 Invalid, 4764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 4332 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 16:56:59,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-07-12 16:56:59,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 881. [2022-07-12 16:56:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 570 states have (on average 1.1333333333333333) internal successors, (646), 606 states have internal predecessors, (646), 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) [2022-07-12 16:56:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1015 transitions. [2022-07-12 16:56:59,526 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1015 transitions. Word has length 138 [2022-07-12 16:56:59,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:59,526 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1015 transitions. [2022-07-12 16:56:59,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 3.88) internal successors, (97), 22 states have internal predecessors, (97), 10 states have call successors, (38), 3 states have call predecessors, (38), 9 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) [2022-07-12 16:56:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1015 transitions. [2022-07-12 16:56:59,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-12 16:56:59,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:59,528 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:56:59,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 16:56:59,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-12 16:56:59,748 INFO L420 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)] === [2022-07-12 16:56:59,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:59,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1893739651, now seen corresponding path program 1 times [2022-07-12 16:56:59,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:59,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468232404] [2022-07-12 16:56:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:59,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:57:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:57:00,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:57:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:57:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 16:57:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:57:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:57:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 16:57:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:57:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 16:57:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 16:57:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:57:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-12 16:57:00,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:00,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468232404] [2022-07-12 16:57:00,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468232404] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:57:00,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067295895] [2022-07-12 16:57:00,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:00,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:00,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:57:00,262 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) [2022-07-12 16:57:00,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 16:57:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:00,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 1939 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-12 16:57:00,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:57:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-12 16:57:01,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 16:57:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-07-12 16:57:01,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067295895] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 16:57:01,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 16:57:01,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 16] total 46 [2022-07-12 16:57:01,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538114739] [2022-07-12 16:57:01,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 16:57:01,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 16:57:01,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:01,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 16:57:01,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2022-07-12 16:57:01,922 INFO L87 Difference]: Start difference. First operand 881 states and 1015 transitions. Second operand has 46 states, 40 states have (on average 3.1) internal successors, (124), 34 states have internal predecessors, (124), 12 states have call successors, (48), 4 states have call predecessors, (48), 12 states have return successors, (49), 18 states have call predecessors, (49), 12 states have call successors, (49) [2022-07-12 16:57:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:07,902 INFO L93 Difference]: Finished difference Result 1562 states and 1821 transitions. [2022-07-12 16:57:07,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 16:57:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 40 states have (on average 3.1) internal successors, (124), 34 states have internal predecessors, (124), 12 states have call successors, (48), 4 states have call predecessors, (48), 12 states have return successors, (49), 18 states have call predecessors, (49), 12 states have call successors, (49) Word has length 143 [2022-07-12 16:57:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:07,906 INFO L225 Difference]: With dead ends: 1562 [2022-07-12 16:57:07,906 INFO L226 Difference]: Without dead ends: 842 [2022-07-12 16:57:07,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=254, Invalid=3652, Unknown=0, NotChecked=0, Total=3906 [2022-07-12 16:57:07,909 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 436 mSDsluCounter, 6746 mSDsCounter, 0 mSdLazyCounter, 10591 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 7231 SdHoareTripleChecker+Invalid, 11089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 10591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:07,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 7231 Invalid, 11089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 10591 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-12 16:57:07,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-07-12 16:57:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 767. [2022-07-12 16:57:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 495 states have (on average 1.1373737373737374) internal successors, (563), 527 states have internal predecessors, (563), 157 states have call successors, (157), 93 states have call predecessors, (157), 93 states have return successors, (156), 150 states have call predecessors, (156), 155 states have call successors, (156) [2022-07-12 16:57:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 876 transitions. [2022-07-12 16:57:07,972 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 876 transitions. Word has length 143 [2022-07-12 16:57:07,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:07,972 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 876 transitions. [2022-07-12 16:57:07,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 40 states have (on average 3.1) internal successors, (124), 34 states have internal predecessors, (124), 12 states have call successors, (48), 4 states have call predecessors, (48), 12 states have return successors, (49), 18 states have call predecessors, (49), 12 states have call successors, (49) [2022-07-12 16:57:07,972 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 876 transitions. [2022-07-12 16:57:07,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-12 16:57:07,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:07,974 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:57:07,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 16:57:08,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 16:57:08,196 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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)] === [2022-07-12 16:57:08,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1252398581, now seen corresponding path program 1 times [2022-07-12 16:57:08,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:08,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929044310] [2022-07-12 16:57:08,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:08,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:57:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:57:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:57:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:57:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:57:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:57:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:57:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:57:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:57:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:57:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-07-12 16:57:08,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:08,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929044310] [2022-07-12 16:57:08,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929044310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:08,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:08,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 16:57:08,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437340098] [2022-07-12 16:57:08,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:08,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 16:57:08,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:08,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 16:57:08,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 16:57:08,405 INFO L87 Difference]: Start difference. First operand 767 states and 876 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) [2022-07-12 16:57:09,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:09,030 INFO L93 Difference]: Finished difference Result 1203 states and 1371 transitions. [2022-07-12 16:57:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:09,030 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 [2022-07-12 16:57:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:09,035 INFO L225 Difference]: With dead ends: 1203 [2022-07-12 16:57:09,035 INFO L226 Difference]: Without dead ends: 1201 [2022-07-12 16:57:09,036 INFO L412 NwaCegarLoop]: 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 [2022-07-12 16:57:09,038 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 585 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:09,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 748 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 16:57:09,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-07-12 16:57:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 889. [2022-07-12 16:57:09,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 575 states have (on average 1.1356521739130434) internal successors, (653), 611 states have internal predecessors, (653), 181 states have call successors, (181), 109 states have call predecessors, (181), 111 states have return successors, (186), 172 states have call predecessors, (186), 179 states have call successors, (186) [2022-07-12 16:57:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1020 transitions. [2022-07-12 16:57:09,115 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1020 transitions. Word has length 149 [2022-07-12 16:57:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:09,116 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1020 transitions. [2022-07-12 16:57:09,116 INFO L496 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) [2022-07-12 16:57:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1020 transitions. [2022-07-12 16:57:09,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 16:57:09,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:09,117 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:57:09,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 16:57:09,118 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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)] === [2022-07-12 16:57:09,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1102990983, now seen corresponding path program 1 times [2022-07-12 16:57:09,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:09,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805785741] [2022-07-12 16:57:09,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:09,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:09,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:57:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:57:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:57:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:57:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:57:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:57:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:57:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 16:57:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 16:57:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 16:57:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 16:57:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:57:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:57:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-12 16:57:09,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:09,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805785741] [2022-07-12 16:57:09,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805785741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:57:09,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016603460] [2022-07-12 16:57:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:09,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:09,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:57:09,775 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) [2022-07-12 16:57:09,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 16:57:10,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:10,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 1933 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-12 16:57:10,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:57:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-12 16:57:10,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 16:57:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-12 16:57:11,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016603460] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 16:57:11,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 16:57:11,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 15] total 40 [2022-07-12 16:57:11,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288958186] [2022-07-12 16:57:11,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 16:57:11,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-12 16:57:11,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:11,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-12 16:57:11,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1455, Unknown=0, NotChecked=0, Total=1560 [2022-07-12 16:57:11,620 INFO L87 Difference]: Start difference. First operand 889 states and 1020 transitions. Second operand has 40 states, 36 states have (on average 4.416666666666667) internal successors, (159), 33 states have internal predecessors, (159), 17 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (57), 16 states have call predecessors, (57), 17 states have call successors, (57) [2022-07-12 16:57:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:18,357 INFO L93 Difference]: Finished difference Result 1433 states and 1590 transitions. [2022-07-12 16:57:18,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-12 16:57:18,358 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 4.416666666666667) internal successors, (159), 33 states have internal predecessors, (159), 17 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (57), 16 states have call predecessors, (57), 17 states have call successors, (57) Word has length 144 [2022-07-12 16:57:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:18,362 INFO L225 Difference]: With dead ends: 1433 [2022-07-12 16:57:18,362 INFO L226 Difference]: Without dead ends: 1159 [2022-07-12 16:57:18,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 309 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=576, Invalid=5124, Unknown=0, NotChecked=0, Total=5700 [2022-07-12 16:57:18,364 INFO L413 NwaCegarLoop]: 557 mSDtfsCounter, 1714 mSDsluCounter, 4069 mSDsCounter, 0 mSdLazyCounter, 11348 mSolverCounterSat, 1355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 4626 SdHoareTripleChecker+Invalid, 12703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1355 IncrementalHoareTripleChecker+Valid, 11348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:18,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 4626 Invalid, 12703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1355 Valid, 11348 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-12 16:57:18,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-07-12 16:57:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 884. [2022-07-12 16:57:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 574 states have (on average 1.1289198606271778) internal successors, (648), 610 states have internal predecessors, (648), 175 states have call successors, (175), 109 states have call predecessors, (175), 113 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2022-07-12 16:57:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1005 transitions. [2022-07-12 16:57:18,490 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1005 transitions. Word has length 144 [2022-07-12 16:57:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:18,490 INFO L495 AbstractCegarLoop]: Abstraction has 884 states and 1005 transitions. [2022-07-12 16:57:18,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 4.416666666666667) internal successors, (159), 33 states have internal predecessors, (159), 17 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (57), 16 states have call predecessors, (57), 17 states have call successors, (57) [2022-07-12 16:57:18,490 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1005 transitions. [2022-07-12 16:57:18,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-12 16:57:18,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:18,493 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:57:18,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 16:57:18,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:18,700 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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)] === [2022-07-12 16:57:18,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:18,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1777528727, now seen corresponding path program 1 times [2022-07-12 16:57:18,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:18,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486594788] [2022-07-12 16:57:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:18,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:57:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:57:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:57:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:57:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:57:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:57:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:57:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 16:57:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 16:57:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 16:57:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 16:57:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:57:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 16:57:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-12 16:57:18,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:18,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486594788] [2022-07-12 16:57:18,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486594788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:18,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:18,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 16:57:18,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768535476] [2022-07-12 16:57:18,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:18,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 16:57:18,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:18,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 16:57:18,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 16:57:18,902 INFO L87 Difference]: Start difference. First operand 884 states and 1005 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) [2022-07-12 16:57:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:19,446 INFO L93 Difference]: Finished difference Result 884 states and 1005 transitions. [2022-07-12 16:57:19,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 16:57:19,446 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 [2022-07-12 16:57:19,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:19,449 INFO L225 Difference]: With dead ends: 884 [2022-07-12 16:57:19,449 INFO L226 Difference]: Without dead ends: 882 [2022-07-12 16:57:19,450 INFO L412 NwaCegarLoop]: 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 [2022-07-12 16:57:19,450 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 811 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:19,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 701 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:57:19,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-07-12 16:57:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2022-07-12 16:57:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 573 states have (on average 1.12565445026178) internal successors, (645), 608 states have internal predecessors, (645), 175 states have call successors, (175), 109 states have call predecessors, (175), 113 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2022-07-12 16:57:19,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1002 transitions. [2022-07-12 16:57:19,590 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1002 transitions. Word has length 146 [2022-07-12 16:57:19,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:19,591 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 1002 transitions. [2022-07-12 16:57:19,591 INFO L496 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) [2022-07-12 16:57:19,591 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1002 transitions. [2022-07-12 16:57:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 16:57:19,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:19,593 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:57:19,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 16:57:19,593 INFO L420 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)] === [2022-07-12 16:57:19,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:19,594 INFO L85 PathProgramCache]: Analyzing trace with hash -608956573, now seen corresponding path program 1 times [2022-07-12 16:57:19,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:19,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956971249] [2022-07-12 16:57:19,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:19,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:57:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:57:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:57:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:57:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:57:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:57:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:57:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 16:57:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 16:57:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 16:57:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 16:57:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:57:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:57:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-12 16:57:20,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:20,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956971249] [2022-07-12 16:57:20,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956971249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:57:20,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426052036] [2022-07-12 16:57:20,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:20,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:20,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:57:20,376 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) [2022-07-12 16:57:20,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 16:57:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 1952 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 16:57:20,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:57:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-12 16:57:21,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 16:57:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 16:57:21,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426052036] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 16:57:21,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 16:57:21,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16, 15] total 50 [2022-07-12 16:57:21,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425458791] [2022-07-12 16:57:21,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 16:57:21,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-12 16:57:21,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:21,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-12 16:57:21,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2321, Unknown=0, NotChecked=0, Total=2450 [2022-07-12 16:57:21,962 INFO L87 Difference]: Start difference. First operand 882 states and 1002 transitions. Second operand has 50 states, 43 states have (on average 3.86046511627907) internal successors, (166), 40 states have internal predecessors, (166), 20 states have call successors, (63), 6 states have call predecessors, (63), 9 states have return successors, (65), 25 states have call predecessors, (65), 20 states have call successors, (65) [2022-07-12 16:57:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:28,176 INFO L93 Difference]: Finished difference Result 1072 states and 1195 transitions. [2022-07-12 16:57:28,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 16:57:28,177 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 3.86046511627907) internal successors, (166), 40 states have internal predecessors, (166), 20 states have call successors, (63), 6 states have call predecessors, (63), 9 states have return successors, (65), 25 states have call predecessors, (65), 20 states have call successors, (65) Word has length 150 [2022-07-12 16:57:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:28,180 INFO L225 Difference]: With dead ends: 1072 [2022-07-12 16:57:28,180 INFO L226 Difference]: Without dead ends: 898 [2022-07-12 16:57:28,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 321 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=564, Invalid=6078, Unknown=0, NotChecked=0, Total=6642 [2022-07-12 16:57:28,182 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 2008 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 7807 mSolverCounterSat, 1441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 9248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1441 IncrementalHoareTripleChecker+Valid, 7807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:28,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 2965 Invalid, 9248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1441 Valid, 7807 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 16:57:28,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2022-07-12 16:57:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 894. [2022-07-12 16:57:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 581 states have (on average 1.1239242685025816) internal successors, (653), 618 states have internal predecessors, (653), 175 states have call successors, (175), 111 states have call predecessors, (175), 117 states have return successors, (186), 168 states have call predecessors, (186), 173 states have call successors, (186) [2022-07-12 16:57:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1014 transitions. [2022-07-12 16:57:28,312 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1014 transitions. Word has length 150 [2022-07-12 16:57:28,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:28,312 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 1014 transitions. [2022-07-12 16:57:28,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 3.86046511627907) internal successors, (166), 40 states have internal predecessors, (166), 20 states have call successors, (63), 6 states have call predecessors, (63), 9 states have return successors, (65), 25 states have call predecessors, (65), 20 states have call successors, (65) [2022-07-12 16:57:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1014 transitions. [2022-07-12 16:57:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-12 16:57:28,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:28,315 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:28,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 16:57:28,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 16:57:28,530 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:57:28,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:28,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1189834910, now seen corresponding path program 1 times [2022-07-12 16:57:28,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:28,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767113522] [2022-07-12 16:57:28,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:28,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:57:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:57:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:57:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:57:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:57:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:57:28,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:57:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 16:57:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 16:57:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 16:57:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 16:57:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:57:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 16:57:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 16:57:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-12 16:57:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:28,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767113522] [2022-07-12 16:57:28,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767113522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:28,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:28,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 16:57:28,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647570690] [2022-07-12 16:57:28,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:28,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 16:57:28,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:28,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 16:57:28,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 16:57:28,728 INFO L87 Difference]: Start difference. First operand 894 states and 1014 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 16:57:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:29,335 INFO L93 Difference]: Finished difference Result 894 states and 1014 transitions. [2022-07-12 16:57:29,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 16:57:29,335 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 152 [2022-07-12 16:57:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:29,338 INFO L225 Difference]: With dead ends: 894 [2022-07-12 16:57:29,338 INFO L226 Difference]: Without dead ends: 892 [2022-07-12 16:57:29,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 16:57:29,339 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 803 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:29,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 699 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:57:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-07-12 16:57:29,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2022-07-12 16:57:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 580 states have (on average 1.1206896551724137) internal successors, (650), 616 states have internal predecessors, (650), 175 states have call successors, (175), 111 states have call predecessors, (175), 117 states have return successors, (186), 168 states have call predecessors, (186), 173 states have call successors, (186) [2022-07-12 16:57:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1011 transitions. [2022-07-12 16:57:29,464 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1011 transitions. Word has length 152 [2022-07-12 16:57:29,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:29,464 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1011 transitions. [2022-07-12 16:57:29,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 16:57:29,465 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1011 transitions. [2022-07-12 16:57:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 16:57:29,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:29,466 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:29,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 16:57:29,466 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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)] === [2022-07-12 16:57:29,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:29,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1381837497, now seen corresponding path program 1 times [2022-07-12 16:57:29,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:29,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977409970] [2022-07-12 16:57:29,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:29,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:57:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:57:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:57:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:57:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:57:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:57:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:57:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 16:57:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 16:57:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 16:57:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 16:57:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:29,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:57:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:57:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-12 16:57:30,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:30,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977409970] [2022-07-12 16:57:30,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977409970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:57:30,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126237662] [2022-07-12 16:57:30,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:30,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:30,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:57:30,184 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) [2022-07-12 16:57:30,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 16:57:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 1971 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-12 16:57:30,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:57:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 71 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 16:57:31,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 16:57:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-12 16:57:31,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126237662] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 16:57:31,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 16:57:31,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 16] total 48 [2022-07-12 16:57:31,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282906933] [2022-07-12 16:57:31,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 16:57:31,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-12 16:57:31,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:31,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-12 16:57:31,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2121, Unknown=0, NotChecked=0, Total=2256 [2022-07-12 16:57:31,962 INFO L87 Difference]: Start difference. First operand 892 states and 1011 transitions. Second operand has 48 states, 44 states have (on average 3.590909090909091) internal successors, (158), 35 states have internal predecessors, (158), 16 states have call successors, (59), 7 states have call predecessors, (59), 12 states have return successors, (61), 19 states have call predecessors, (61), 16 states have call successors, (61) [2022-07-12 16:57:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:36,418 INFO L93 Difference]: Finished difference Result 1123 states and 1243 transitions. [2022-07-12 16:57:36,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 16:57:36,419 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 3.590909090909091) internal successors, (158), 35 states have internal predecessors, (158), 16 states have call successors, (59), 7 states have call predecessors, (59), 12 states have return successors, (61), 19 states have call predecessors, (61), 16 states have call successors, (61) Word has length 156 [2022-07-12 16:57:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:36,422 INFO L225 Difference]: With dead ends: 1123 [2022-07-12 16:57:36,422 INFO L226 Difference]: Without dead ends: 887 [2022-07-12 16:57:36,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 331 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=484, Invalid=4918, Unknown=0, NotChecked=0, Total=5402 [2022-07-12 16:57:36,424 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 1389 mSDsluCounter, 2981 mSDsCounter, 0 mSdLazyCounter, 7637 mSolverCounterSat, 950 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 8587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 950 IncrementalHoareTripleChecker+Valid, 7637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:36,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 3282 Invalid, 8587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [950 Valid, 7637 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 16:57:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-07-12 16:57:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 878. [2022-07-12 16:57:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 574 states have (on average 1.1184668989547037) internal successors, (642), 604 states have internal predecessors, (642), 173 states have call successors, (173), 111 states have call predecessors, (173), 111 states have return successors, (176), 166 states have call predecessors, (176), 171 states have call successors, (176) [2022-07-12 16:57:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 991 transitions. [2022-07-12 16:57:36,572 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 991 transitions. Word has length 156 [2022-07-12 16:57:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:36,572 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 991 transitions. [2022-07-12 16:57:36,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 3.590909090909091) internal successors, (158), 35 states have internal predecessors, (158), 16 states have call successors, (59), 7 states have call predecessors, (59), 12 states have return successors, (61), 19 states have call predecessors, (61), 16 states have call successors, (61) [2022-07-12 16:57:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 991 transitions. [2022-07-12 16:57:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-12 16:57:36,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:36,575 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:36,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 16:57:36,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 16:57:36,784 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:57:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash -982153904, now seen corresponding path program 1 times [2022-07-12 16:57:36,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:36,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048071485] [2022-07-12 16:57:36,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:36,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:57:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:57:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:57:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:57:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:57:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:57:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:57:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 16:57:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 16:57:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 16:57:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 16:57:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:57:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 16:57:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 16:57:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 16:57:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-12 16:57:37,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:37,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048071485] [2022-07-12 16:57:37,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048071485] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:57:37,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264348473] [2022-07-12 16:57:37,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:37,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:37,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:57:37,424 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) [2022-07-12 16:57:37,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 16:57:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:37,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 1916 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-12 16:57:37,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:57:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 57 proven. 13 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-12 16:57:38,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 16:57:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-12 16:57:39,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264348473] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 16:57:39,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 16:57:39,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 21] total 51 [2022-07-12 16:57:39,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442789950] [2022-07-12 16:57:39,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 16:57:39,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-12 16:57:39,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:39,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-12 16:57:39,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2399, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 16:57:39,162 INFO L87 Difference]: Start difference. First operand 878 states and 991 transitions. Second operand has 51 states, 43 states have (on average 3.511627906976744) internal successors, (151), 35 states have internal predecessors, (151), 15 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (52), 20 states have call predecessors, (52), 15 states have call successors, (52) [2022-07-12 16:57:43,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:43,789 INFO L93 Difference]: Finished difference Result 1134 states and 1269 transitions. [2022-07-12 16:57:43,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 16:57:43,790 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 3.511627906976744) internal successors, (151), 35 states have internal predecessors, (151), 15 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (52), 20 states have call predecessors, (52), 15 states have call successors, (52) Word has length 158 [2022-07-12 16:57:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:43,793 INFO L225 Difference]: With dead ends: 1134 [2022-07-12 16:57:43,793 INFO L226 Difference]: Without dead ends: 877 [2022-07-12 16:57:43,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 330 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=444, Invalid=5106, Unknown=0, NotChecked=0, Total=5550 [2022-07-12 16:57:43,795 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 1149 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 7863 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 8731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 7863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:43,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 2917 Invalid, 8731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 7863 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 16:57:43,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2022-07-12 16:57:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 876. [2022-07-12 16:57:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 572 states have (on average 1.117132867132867) internal successors, (639), 602 states have internal predecessors, (639), 173 states have call successors, (173), 111 states have call predecessors, (173), 111 states have return successors, (176), 166 states have call predecessors, (176), 171 states have call successors, (176) [2022-07-12 16:57:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 988 transitions. [2022-07-12 16:57:43,963 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 988 transitions. Word has length 158 [2022-07-12 16:57:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:43,963 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 988 transitions. [2022-07-12 16:57:43,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 3.511627906976744) internal successors, (151), 35 states have internal predecessors, (151), 15 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (52), 20 states have call predecessors, (52), 15 states have call successors, (52) [2022-07-12 16:57:43,964 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 988 transitions. [2022-07-12 16:57:43,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 16:57:43,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:43,966 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:43,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 16:57:44,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:44,173 INFO L420 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)] === [2022-07-12 16:57:44,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash 350553155, now seen corresponding path program 1 times [2022-07-12 16:57:44,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:44,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704239419] [2022-07-12 16:57:44,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:44,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:57:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:57:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 16:57:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:57:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:57:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 16:57:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:57:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 16:57:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 16:57:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:57:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 16:57:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 16:57:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:57:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 16:57:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:57:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:57:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 16:57:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 16:57:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:57:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 16:57:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-07-12 16:57:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:44,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704239419] [2022-07-12 16:57:44,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704239419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:44,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:44,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 16:57:44,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203651908] [2022-07-12 16:57:44,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:44,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 16:57:44,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:44,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 16:57:44,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:44,376 INFO L87 Difference]: Start difference. First operand 876 states and 988 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-12 16:57:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:45,762 INFO L93 Difference]: Finished difference Result 1424 states and 1665 transitions. [2022-07-12 16:57:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 16:57:45,763 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 187 [2022-07-12 16:57:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:45,767 INFO L225 Difference]: With dead ends: 1424 [2022-07-12 16:57:45,767 INFO L226 Difference]: Without dead ends: 1020 [2022-07-12 16:57:45,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-07-12 16:57:45,768 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 695 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:45,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1786 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 16:57:45,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2022-07-12 16:57:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 876. [2022-07-12 16:57:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 572 states have (on average 1.1136363636363635) internal successors, (637), 602 states have internal predecessors, (637), 173 states have call successors, (173), 111 states have call predecessors, (173), 111 states have return successors, (176), 166 states have call predecessors, (176), 171 states have call successors, (176) [2022-07-12 16:57:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 986 transitions. [2022-07-12 16:57:45,958 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 986 transitions. Word has length 187 [2022-07-12 16:57:45,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:45,958 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 986 transitions. [2022-07-12 16:57:45,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-12 16:57:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 986 transitions. [2022-07-12 16:57:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-12 16:57:45,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:45,961 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:45,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 16:57:45,961 INFO L420 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)] === [2022-07-12 16:57:45,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:45,962 INFO L85 PathProgramCache]: Analyzing trace with hash -241695337, now seen corresponding path program 1 times [2022-07-12 16:57:45,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:45,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225841834] [2022-07-12 16:57:45,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:45,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:46,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:57:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 16:57:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 16:57:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:57:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:57:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 16:57:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:57:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 16:57:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 16:57:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:57:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 16:57:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:57:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 16:57:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 16:57:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 16:57:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 16:57:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 16:57:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 16:57:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 16:57:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:57:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 16:57:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 16:57:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-12 16:57:46,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:46,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225841834] [2022-07-12 16:57:46,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225841834] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:57:46,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995912872] [2022-07-12 16:57:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:46,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:46,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:57:46,195 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:57:46,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 16:57:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:46,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 16:57:46,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:57:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-12 16:57:46,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 16:57:46,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995912872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:46,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 16:57:46,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 11 [2022-07-12 16:57:46,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044984592] [2022-07-12 16:57:46,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:46,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 16:57:46,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:46,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 16:57:46,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:57:46,522 INFO L87 Difference]: Start difference. First operand 876 states and 986 transitions. Second operand has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-07-12 16:57:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:46,725 INFO L93 Difference]: Finished difference Result 1048 states and 1152 transitions. [2022-07-12 16:57:46,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:46,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 198 [2022-07-12 16:57:46,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:46,728 INFO L225 Difference]: With dead ends: 1048 [2022-07-12 16:57:46,728 INFO L226 Difference]: Without dead ends: 684 [2022-07-12 16:57:46,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 16:57:46,729 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 2 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:46,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2208 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 16:57:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-07-12 16:57:46,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2022-07-12 16:57:46,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 443 states have (on average 1.1264108352144468) internal successors, (499), 469 states have internal predecessors, (499), 134 states have call successors, (134), 88 states have call predecessors, (134), 87 states have return successors, (136), 128 states have call predecessors, (136), 132 states have call successors, (136) [2022-07-12 16:57:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 769 transitions. [2022-07-12 16:57:46,887 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 769 transitions. Word has length 198 [2022-07-12 16:57:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:46,887 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 769 transitions. [2022-07-12 16:57:46,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-07-12 16:57:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 769 transitions. [2022-07-12 16:57:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-12 16:57:46,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:46,889 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:46,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 16:57:47,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:47,102 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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)] === [2022-07-12 16:57:47,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:47,102 INFO L85 PathProgramCache]: Analyzing trace with hash -356239818, now seen corresponding path program 1 times [2022-07-12 16:57:47,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:47,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041303649] [2022-07-12 16:57:47,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:47,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:57:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:57:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:57:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:57:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:57:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:57:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:57:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:47,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:57:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:57:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:57:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:57:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 16:57:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 16:57:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 16:57:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 16:57:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:57:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 16:57:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:57:47,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:47,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041303649] [2022-07-12 16:57:47,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041303649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:47,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:47,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-12 16:57:47,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646550992] [2022-07-12 16:57:47,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:47,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 16:57:47,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:47,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 16:57:47,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-07-12 16:57:47,570 INFO L87 Difference]: Start difference. First operand 684 states and 769 transitions. Second operand has 21 states, 18 states have (on average 5.166666666666667) internal successors, (93), 15 states have internal predecessors, (93), 9 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2022-07-12 16:57:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:50,439 INFO L93 Difference]: Finished difference Result 1408 states and 1672 transitions. [2022-07-12 16:57:50,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 16:57:50,440 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.166666666666667) internal successors, (93), 15 states have internal predecessors, (93), 9 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) Word has length 206 [2022-07-12 16:57:50,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:50,443 INFO L225 Difference]: With dead ends: 1408 [2022-07-12 16:57:50,443 INFO L226 Difference]: Without dead ends: 878 [2022-07-12 16:57:50,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2022-07-12 16:57:50,445 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 1329 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 4815 mSolverCounterSat, 1510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 6325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1510 IncrementalHoareTripleChecker+Valid, 4815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:50,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1989 Invalid, 6325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1510 Valid, 4815 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 16:57:50,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-07-12 16:57:50,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 690. [2022-07-12 16:57:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 445 states have (on average 1.1213483146067416) internal successors, (499), 473 states have internal predecessors, (499), 136 states have call successors, (136), 88 states have call predecessors, (136), 89 states have return successors, (140), 130 states have call predecessors, (140), 134 states have call successors, (140) [2022-07-12 16:57:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 775 transitions. [2022-07-12 16:57:50,606 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 775 transitions. Word has length 206 [2022-07-12 16:57:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:50,606 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 775 transitions. [2022-07-12 16:57:50,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.166666666666667) internal successors, (93), 15 states have internal predecessors, (93), 9 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2022-07-12 16:57:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 775 transitions. [2022-07-12 16:57:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-12 16:57:50,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:50,608 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:50,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 16:57:50,608 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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)] === [2022-07-12 16:57:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1497570482, now seen corresponding path program 1 times [2022-07-12 16:57:50,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:50,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458181096] [2022-07-12 16:57:50,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:50,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:50,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:50,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:50,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:57:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:50,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:57:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:50,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:50,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:57:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:50,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:57:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:57:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:57:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:57:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:57:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:57:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:57:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 16:57:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:57:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 16:57:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 16:57:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 16:57:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 16:57:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 16:57:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 16:57:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-07-12 16:57:51,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:51,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458181096] [2022-07-12 16:57:51,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458181096] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:57:51,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316116381] [2022-07-12 16:57:51,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:51,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:51,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:57:51,356 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:57:51,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 16:57:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 2160 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 16:57:51,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:57:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-07-12 16:57:52,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 16:57:52,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316116381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:52,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 16:57:52,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [27] total 44 [2022-07-12 16:57:52,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769796889] [2022-07-12 16:57:52,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:52,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 16:57:52,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:52,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 16:57:52,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1795, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 16:57:52,167 INFO L87 Difference]: Start difference. First operand 690 states and 775 transitions. Second operand has 19 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 8 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-07-12 16:57:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:53,196 INFO L93 Difference]: Finished difference Result 960 states and 1070 transitions. [2022-07-12 16:57:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 16:57:53,197 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 8 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 215 [2022-07-12 16:57:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:53,200 INFO L225 Difference]: With dead ends: 960 [2022-07-12 16:57:53,200 INFO L226 Difference]: Without dead ends: 708 [2022-07-12 16:57:53,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=357, Invalid=3675, Unknown=0, NotChecked=0, Total=4032 [2022-07-12 16:57:53,202 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 119 mSDsluCounter, 7043 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 7499 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:53,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 7499 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:57:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-07-12 16:57:53,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 677. [2022-07-12 16:57:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 438 states have (on average 1.1118721461187215) internal successors, (487), 465 states have internal predecessors, (487), 131 states have call successors, (131), 85 states have call predecessors, (131), 89 states have return successors, (135), 128 states have call predecessors, (135), 129 states have call successors, (135) [2022-07-12 16:57:53,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 753 transitions. [2022-07-12 16:57:53,354 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 753 transitions. Word has length 215 [2022-07-12 16:57:53,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:53,354 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 753 transitions. [2022-07-12 16:57:53,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 8 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-07-12 16:57:53,355 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 753 transitions. [2022-07-12 16:57:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-12 16:57:53,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:53,356 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:57:53,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 16:57:53,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 16:57:53,576 INFO L420 AbstractCegarLoop]: === Iteration 24 === 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)] === [2022-07-12 16:57:53,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:53,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1299940040, now seen corresponding path program 1 times [2022-07-12 16:57:53,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:53,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970876340] [2022-07-12 16:57:53,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:53,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:57:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:57:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:57:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:57:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:57:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:57:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:57:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:57:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:57:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 16:57:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:57:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 16:57:53,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 16:57:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 16:57:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 16:57:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 16:57:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:57:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:57:53,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:53,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970876340] [2022-07-12 16:57:53,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970876340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:53,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:53,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:57:53,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117913774] [2022-07-12 16:57:53,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:53,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:57:53,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:53,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:57:53,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:57:53,738 INFO L87 Difference]: Start difference. First operand 677 states and 753 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-12 16:57:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:54,654 INFO L93 Difference]: Finished difference Result 714 states and 773 transitions. [2022-07-12 16:57:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 16:57:54,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 210 [2022-07-12 16:57:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:54,657 INFO L225 Difference]: With dead ends: 714 [2022-07-12 16:57:54,657 INFO L226 Difference]: Without dead ends: 712 [2022-07-12 16:57:54,657 INFO L412 NwaCegarLoop]: 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 [2022-07-12 16:57:54,658 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 1461 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:54,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 875 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 16:57:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-12 16:57:54,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 675. [2022-07-12 16:57:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 437 states have (on average 1.1098398169336385) internal successors, (485), 463 states have internal predecessors, (485), 131 states have call successors, (131), 85 states have call predecessors, (131), 89 states have return successors, (135), 128 states have call predecessors, (135), 129 states have call successors, (135) [2022-07-12 16:57:54,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 751 transitions. [2022-07-12 16:57:54,800 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 751 transitions. Word has length 210 [2022-07-12 16:57:54,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:54,800 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 751 transitions. [2022-07-12 16:57:54,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-12 16:57:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 751 transitions. [2022-07-12 16:57:54,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-12 16:57:54,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:54,802 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:57:54,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 16:57:54,802 INFO L420 AbstractCegarLoop]: === Iteration 25 === 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)] === [2022-07-12 16:57:54,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:54,803 INFO L85 PathProgramCache]: Analyzing trace with hash -600142417, now seen corresponding path program 1 times [2022-07-12 16:57:54,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:54,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370987220] [2022-07-12 16:57:54,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:54,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:54,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:54,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:57:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:57:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:57:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:57:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:57:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:57:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:57:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:57:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:57:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:57:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:57:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 16:57:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:57:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 16:57:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 16:57:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 16:57:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 16:57:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 16:57:55,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 16:57:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 16:57:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-12 16:57:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-12 16:57:55,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:55,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370987220] [2022-07-12 16:57:55,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370987220] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:57:55,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936314964] [2022-07-12 16:57:55,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:55,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:55,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:57:55,232 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:57:55,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 16:57:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:55,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 2096 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 16:57:55,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:57:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 153 proven. 21 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-12 16:57:55,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 16:57:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-12 16:57:56,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936314964] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 16:57:56,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 16:57:56,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 15] total 33 [2022-07-12 16:57:56,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049896736] [2022-07-12 16:57:56,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 16:57:56,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 16:57:56,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:56,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 16:57:56,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 16:57:56,377 INFO L87 Difference]: Start difference. First operand 675 states and 751 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) [2022-07-12 16:57:59,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:59,960 INFO L93 Difference]: Finished difference Result 1064 states and 1177 transitions. [2022-07-12 16:57:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 16:57:59,961 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 [2022-07-12 16:57:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:59,963 INFO L225 Difference]: With dead ends: 1064 [2022-07-12 16:57:59,963 INFO L226 Difference]: Without dead ends: 687 [2022-07-12 16:57:59,964 INFO L412 NwaCegarLoop]: 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 [2022-07-12 16:57:59,965 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 1216 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 5595 mSolverCounterSat, 1025 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 2466 SdHoareTripleChecker+Invalid, 6620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1025 IncrementalHoareTripleChecker+Valid, 5595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:59,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 2466 Invalid, 6620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1025 Valid, 5595 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-12 16:57:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-07-12 16:58:00,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 663. [2022-07-12 16:58:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 431 states have (on average 1.1020881670533642) internal successors, (475), 454 states have internal predecessors, (475), 129 states have call successors, (129), 84 states have call predecessors, (129), 85 states have return successors, (129), 126 states have call predecessors, (129), 127 states have call successors, (129) [2022-07-12 16:58:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 733 transitions. [2022-07-12 16:58:00,159 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 733 transitions. Word has length 214 [2022-07-12 16:58:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:00,159 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 733 transitions. [2022-07-12 16:58:00,159 INFO L496 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) [2022-07-12 16:58:00,159 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 733 transitions. [2022-07-12 16:58:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-12 16:58:00,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:00,161 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:58:00,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-12 16:58:00,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 16:58:00,362 INFO L420 AbstractCegarLoop]: === Iteration 26 === 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)] === [2022-07-12 16:58:00,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2038632069, now seen corresponding path program 1 times [2022-07-12 16:58:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:00,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209640534] [2022-07-12 16:58:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:58:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:58:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 16:58:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:58:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 16:58:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 16:58:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 16:58:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 16:58:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 16:58:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 16:58:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-12 16:58:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-12 16:58:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-12 16:58:00,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:00,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209640534] [2022-07-12 16:58:00,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209640534] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:58:00,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965390744] [2022-07-12 16:58:00,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:00,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:58:00,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:58:00,606 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:58:00,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 16:58:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 2070 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 16:58:00,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:58:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-12 16:58:01,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 16:58:01,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965390744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:01,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 16:58:01,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 24 [2022-07-12 16:58:01,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756220197] [2022-07-12 16:58:01,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:01,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 16:58:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:01,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 16:58:01,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2022-07-12 16:58:01,070 INFO L87 Difference]: Start difference. First operand 663 states and 733 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) [2022-07-12 16:58:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:01,563 INFO L93 Difference]: Finished difference Result 820 states and 890 transitions. [2022-07-12 16:58:01,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 16:58:01,563 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 [2022-07-12 16:58:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:01,565 INFO L225 Difference]: With dead ends: 820 [2022-07-12 16:58:01,566 INFO L226 Difference]: Without dead ends: 665 [2022-07-12 16:58:01,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 16:58:01,566 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 157 mSDsluCounter, 4390 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 4759 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:01,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 4759 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 16:58:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-12 16:58:01,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2022-07-12 16:58:01,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 431 states have (on average 1.099767981438515) internal successors, (474), 454 states have internal predecessors, (474), 129 states have call successors, (129), 84 states have call predecessors, (129), 85 states have return successors, (129), 126 states have call predecessors, (129), 127 states have call successors, (129) [2022-07-12 16:58:01,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 732 transitions. [2022-07-12 16:58:01,728 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 732 transitions. Word has length 209 [2022-07-12 16:58:01,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:01,729 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 732 transitions. [2022-07-12 16:58:01,729 INFO L496 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) [2022-07-12 16:58:01,729 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 732 transitions. [2022-07-12 16:58:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-12 16:58:01,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:01,730 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:58:01,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-12 16:58:01,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 16:58:01,931 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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)] === [2022-07-12 16:58:01,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:01,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1210752770, now seen corresponding path program 1 times [2022-07-12 16:58:01,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:01,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684381709] [2022-07-12 16:58:01,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:01,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:58:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:58:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 16:58:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:58:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 16:58:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 16:58:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 16:58:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 16:58:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 16:58:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:02,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:02,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684381709] [2022-07-12 16:58:02,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684381709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:02,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:02,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 16:58:02,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566784775] [2022-07-12 16:58:02,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:02,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 16:58:02,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:02,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 16:58:02,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:02,116 INFO L87 Difference]: Start difference. First operand 663 states and 732 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-12 16:58:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:02,940 INFO L93 Difference]: Finished difference Result 663 states and 732 transitions. [2022-07-12 16:58:02,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 16:58:02,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 213 [2022-07-12 16:58:02,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:02,943 INFO L225 Difference]: With dead ends: 663 [2022-07-12 16:58:02,943 INFO L226 Difference]: Without dead ends: 661 [2022-07-12 16:58:02,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-07-12 16:58:02,944 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 928 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:02,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 914 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 16:58:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-07-12 16:58:03,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2022-07-12 16:58:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 430 states have (on average 1.0976744186046512) internal successors, (472), 452 states have internal predecessors, (472), 129 states have call successors, (129), 84 states have call predecessors, (129), 85 states have return successors, (129), 126 states have call predecessors, (129), 127 states have call successors, (129) [2022-07-12 16:58:03,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 730 transitions. [2022-07-12 16:58:03,113 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 730 transitions. Word has length 213 [2022-07-12 16:58:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:03,113 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 730 transitions. [2022-07-12 16:58:03,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-12 16:58:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 730 transitions. [2022-07-12 16:58:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-12 16:58:03,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:03,115 INFO L195 NwaCegarLoop]: 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] [2022-07-12 16:58:03,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 16:58:03,115 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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)] === [2022-07-12 16:58:03,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:03,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2056655727, now seen corresponding path program 1 times [2022-07-12 16:58:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:03,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790386927] [2022-07-12 16:58:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:03,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 16:58:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 16:58:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 16:58:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 16:58:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 16:58:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 16:58:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 16:58:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-12 16:58:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-12 16:58:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-12 16:58:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-12 16:58:03,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:03,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790386927] [2022-07-12 16:58:03,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790386927] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:58:03,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791001948] [2022-07-12 16:58:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:03,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:58:03,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:58:03,659 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:58:03,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 16:58:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 2134 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-12 16:58:03,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:58:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-12 16:58:04,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 16:58:05,152 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-12 16:58:05,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791001948] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 16:58:05,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 16:58:05,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 16] total 43 [2022-07-12 16:58:05,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733550292] [2022-07-12 16:58:05,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 16:58:05,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-12 16:58:05,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:05,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-12 16:58:05,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1682, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 16:58:05,154 INFO L87 Difference]: Start difference. First operand 661 states and 730 transitions. Second operand has 43 states, 40 states have (on average 5.15) internal successors, (206), 32 states have internal predecessors, (206), 15 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (73), 17 states have call predecessors, (73), 15 states have call successors, (73) [2022-07-12 16:58:09,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:09,440 INFO L93 Difference]: Finished difference Result 963 states and 1039 transitions. [2022-07-12 16:58:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 16:58:09,441 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 5.15) internal successors, (206), 32 states have internal predecessors, (206), 15 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (73), 17 states have call predecessors, (73), 15 states have call successors, (73) Word has length 226 [2022-07-12 16:58:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:09,443 INFO L225 Difference]: With dead ends: 963 [2022-07-12 16:58:09,443 INFO L226 Difference]: Without dead ends: 594 [2022-07-12 16:58:09,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 493 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=397, Invalid=3509, Unknown=0, NotChecked=0, Total=3906 [2022-07-12 16:58:09,444 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 1659 mSDsluCounter, 2413 mSDsCounter, 0 mSdLazyCounter, 5990 mSolverCounterSat, 1300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 7290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1300 IncrementalHoareTripleChecker+Valid, 5990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:09,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 2711 Invalid, 7290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1300 Valid, 5990 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 16:58:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-12 16:58:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-07-12 16:58:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 385 states have (on average 1.0987012987012987) internal successors, (423), 405 states have internal predecessors, (423), 114 states have call successors, (114), 79 states have call predecessors, (114), 78 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-12 16:58:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 649 transitions. [2022-07-12 16:58:09,606 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 649 transitions. Word has length 226 [2022-07-12 16:58:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:09,607 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 649 transitions. [2022-07-12 16:58:09,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 5.15) internal successors, (206), 32 states have internal predecessors, (206), 15 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (73), 17 states have call predecessors, (73), 15 states have call successors, (73) [2022-07-12 16:58:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 649 transitions. [2022-07-12 16:58:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-07-12 16:58:09,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:09,608 INFO L195 NwaCegarLoop]: 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, 1, 1, 1] [2022-07-12 16:58:09,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 16:58:09,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-12 16:58:09,809 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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)] === [2022-07-12 16:58:09,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:09,809 INFO L85 PathProgramCache]: Analyzing trace with hash 920927049, now seen corresponding path program 1 times [2022-07-12 16:58:09,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:09,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424077847] [2022-07-12 16:58:09,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:09,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:09,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:09,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:09,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424077847] [2022-07-12 16:58:09,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424077847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:09,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:09,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:09,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90758049] [2022-07-12 16:58:09,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:09,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:09,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:09,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:09,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:09,993 INFO L87 Difference]: Start difference. First operand 594 states and 649 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (35), 6 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-12 16:58:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:10,681 INFO L93 Difference]: Finished difference Result 594 states and 649 transitions. [2022-07-12 16:58:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 16:58:10,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (35), 6 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 229 [2022-07-12 16:58:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:10,684 INFO L225 Difference]: With dead ends: 594 [2022-07-12 16:58:10,684 INFO L226 Difference]: Without dead ends: 592 [2022-07-12 16:58:10,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-07-12 16:58:10,688 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 911 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:10,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 754 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 16:58:10,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-12 16:58:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2022-07-12 16:58:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 384 states have (on average 1.09375) internal successors, (420), 403 states have internal predecessors, (420), 114 states have call successors, (114), 79 states have call predecessors, (114), 78 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-12 16:58:10,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 646 transitions. [2022-07-12 16:58:10,830 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 646 transitions. Word has length 229 [2022-07-12 16:58:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:10,831 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 646 transitions. [2022-07-12 16:58:10,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (35), 6 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-12 16:58:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 646 transitions. [2022-07-12 16:58:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-12 16:58:10,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:10,832 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:10,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 16:58:10,832 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_fs_char_dev_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)] === [2022-07-12 16:58:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:10,833 INFO L85 PathProgramCache]: Analyzing trace with hash -460235288, now seen corresponding path program 1 times [2022-07-12 16:58:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:10,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596292600] [2022-07-12 16:58:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:10,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:10,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:10,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:10,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:11,000 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:11,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:11,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596292600] [2022-07-12 16:58:11,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596292600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:11,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:11,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:11,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155353817] [2022-07-12 16:58:11,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:11,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:11,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:11,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:11,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:11,002 INFO L87 Difference]: Start difference. First operand 592 states and 646 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (36), 6 states have call predecessors, (36), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 16:58:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:11,882 INFO L93 Difference]: Finished difference Result 627 states and 665 transitions. [2022-07-12 16:58:11,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 16:58:11,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (36), 6 states have call predecessors, (36), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 235 [2022-07-12 16:58:11,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:11,884 INFO L225 Difference]: With dead ends: 627 [2022-07-12 16:58:11,884 INFO L226 Difference]: Without dead ends: 625 [2022-07-12 16:58:11,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-07-12 16:58:11,885 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 944 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:11,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 1107 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 16:58:11,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-07-12 16:58:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 592. [2022-07-12 16:58:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 384 states have (on average 1.0911458333333333) internal successors, (419), 403 states have internal predecessors, (419), 114 states have call successors, (114), 79 states have call predecessors, (114), 78 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-12 16:58:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 645 transitions. [2022-07-12 16:58:12,032 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 645 transitions. Word has length 235 [2022-07-12 16:58:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:12,032 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 645 transitions. [2022-07-12 16:58:12,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (36), 6 states have call predecessors, (36), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-12 16:58:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 645 transitions. [2022-07-12 16:58:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-12 16:58:12,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:12,034 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:12,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 16:58:12,034 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_fs_sysfs_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)] === [2022-07-12 16:58:12,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash -622740987, now seen corresponding path program 1 times [2022-07-12 16:58:12,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:12,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274852792] [2022-07-12 16:58:12,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:12,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:12,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:12,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274852792] [2022-07-12 16:58:12,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274852792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:12,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:12,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:12,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987155661] [2022-07-12 16:58:12,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:12,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:12,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:12,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:12,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:12,249 INFO L87 Difference]: Start difference. First operand 592 states and 645 transitions. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 16:58:12,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:12,870 INFO L93 Difference]: Finished difference Result 592 states and 645 transitions. [2022-07-12 16:58:12,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:12,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 241 [2022-07-12 16:58:12,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:12,873 INFO L225 Difference]: With dead ends: 592 [2022-07-12 16:58:12,873 INFO L226 Difference]: Without dead ends: 590 [2022-07-12 16:58:12,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:12,874 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 904 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:12,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 708 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-07-12 16:58:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2022-07-12 16:58:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 383 states have (on average 1.0861618798955615) internal successors, (416), 401 states have internal predecessors, (416), 114 states have call successors, (114), 79 states have call predecessors, (114), 78 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-12 16:58:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 642 transitions. [2022-07-12 16:58:13,037 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 642 transitions. Word has length 241 [2022-07-12 16:58:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:13,037 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 642 transitions. [2022-07-12 16:58:13,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 16:58:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 642 transitions. [2022-07-12 16:58:13,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-12 16:58:13,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:13,039 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:13,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 16:58:13,039 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_fs_char_dev_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)] === [2022-07-12 16:58:13,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:13,040 INFO L85 PathProgramCache]: Analyzing trace with hash 433711426, now seen corresponding path program 1 times [2022-07-12 16:58:13,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:13,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108721343] [2022-07-12 16:58:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:13,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:58:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:58:13,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 16:58:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 16:58:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 16:58:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 16:58:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 16:58:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 16:58:13,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:13,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:13,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108721343] [2022-07-12 16:58:13,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108721343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:13,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:13,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 16:58:13,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854694983] [2022-07-12 16:58:13,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:13,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 16:58:13,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:13,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 16:58:13,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:58:13,242 INFO L87 Difference]: Start difference. First operand 590 states and 642 transitions. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 7 states have internal predecessors, (116), 4 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2022-07-12 16:58:14,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:14,226 INFO L93 Difference]: Finished difference Result 647 states and 684 transitions. [2022-07-12 16:58:14,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 16:58:14,227 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 7 states have internal predecessors, (116), 4 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 241 [2022-07-12 16:58:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:14,229 INFO L225 Difference]: With dead ends: 647 [2022-07-12 16:58:14,229 INFO L226 Difference]: Without dead ends: 436 [2022-07-12 16:58:14,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-07-12 16:58:14,230 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 777 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:14,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1103 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 16:58:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-07-12 16:58:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2022-07-12 16:58:14,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 281 states have (on average 1.0640569395017794) internal successors, (299), 297 states have internal predecessors, (299), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 471 transitions. [2022-07-12 16:58:14,353 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 471 transitions. Word has length 241 [2022-07-12 16:58:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:14,353 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 471 transitions. [2022-07-12 16:58:14,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 7 states have internal predecessors, (116), 4 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2022-07-12 16:58:14,354 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 471 transitions. [2022-07-12 16:58:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-07-12 16:58:14,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:14,355 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:14,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-12 16:58:14,355 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_kernel_locking_rwlock_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)] === [2022-07-12 16:58:14,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:14,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1683504449, now seen corresponding path program 1 times [2022-07-12 16:58:14,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:14,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743975202] [2022-07-12 16:58:14,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:14,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:14,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:14,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743975202] [2022-07-12 16:58:14,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743975202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:14,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:14,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:14,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470417167] [2022-07-12 16:58:14,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:14,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:14,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:14,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:14,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:14,598 INFO L87 Difference]: Start difference. First operand 436 states and 471 transitions. Second operand has 8 states, 8 states have (on average 15.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-07-12 16:58:15,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:15,222 INFO L93 Difference]: Finished difference Result 436 states and 471 transitions. [2022-07-12 16:58:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:15,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 247 [2022-07-12 16:58:15,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:15,224 INFO L225 Difference]: With dead ends: 436 [2022-07-12 16:58:15,224 INFO L226 Difference]: Without dead ends: 434 [2022-07-12 16:58:15,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:15,225 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 888 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:15,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 704 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:15,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-07-12 16:58:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-07-12 16:58:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 280 states have (on average 1.0607142857142857) internal successors, (297), 295 states have internal predecessors, (297), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 469 transitions. [2022-07-12 16:58:15,330 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 469 transitions. Word has length 247 [2022-07-12 16:58:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:15,330 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 469 transitions. [2022-07-12 16:58:15,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-07-12 16:58:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 469 transitions. [2022-07-12 16:58:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-12 16:58:15,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:15,332 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:15,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-12 16:58:15,332 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_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)] === [2022-07-12 16:58:15,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1354751516, now seen corresponding path program 1 times [2022-07-12 16:58:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:15,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412707191] [2022-07-12 16:58:15,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:15,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:15,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:15,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412707191] [2022-07-12 16:58:15,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412707191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:15,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:15,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:15,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906740867] [2022-07-12 16:58:15,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:15,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:15,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:15,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:15,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:15,518 INFO L87 Difference]: Start difference. First operand 434 states and 469 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-07-12 16:58:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:16,105 INFO L93 Difference]: Finished difference Result 434 states and 469 transitions. [2022-07-12 16:58:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:16,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 249 [2022-07-12 16:58:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:16,107 INFO L225 Difference]: With dead ends: 434 [2022-07-12 16:58:16,107 INFO L226 Difference]: Without dead ends: 432 [2022-07-12 16:58:16,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:16,107 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 872 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:16,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 702 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-07-12 16:58:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2022-07-12 16:58:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 279 states have (on average 1.0573476702508962) internal successors, (295), 293 states have internal predecessors, (295), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 467 transitions. [2022-07-12 16:58:16,209 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 467 transitions. Word has length 249 [2022-07-12 16:58:16,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:16,209 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 467 transitions. [2022-07-12 16:58:16,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-07-12 16:58:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 467 transitions. [2022-07-12 16:58:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-07-12 16:58:16,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:16,210 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:16,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-12 16:58:16,210 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_linux_kernel_module_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)] === [2022-07-12 16:58:16,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:16,211 INFO L85 PathProgramCache]: Analyzing trace with hash -43862279, now seen corresponding path program 1 times [2022-07-12 16:58:16,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:16,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690886351] [2022-07-12 16:58:16,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:16,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:16,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 16:58:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:16,391 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:16,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:16,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690886351] [2022-07-12 16:58:16,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690886351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:16,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:16,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:16,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79844191] [2022-07-12 16:58:16,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:16,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:16,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:16,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:16,393 INFO L87 Difference]: Start difference. First operand 432 states and 467 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-12 16:58:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:17,009 INFO L93 Difference]: Finished difference Result 432 states and 467 transitions. [2022-07-12 16:58:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:17,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 255 [2022-07-12 16:58:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:17,011 INFO L225 Difference]: With dead ends: 432 [2022-07-12 16:58:17,011 INFO L226 Difference]: Without dead ends: 430 [2022-07-12 16:58:17,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:17,011 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 864 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:17,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 700 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-07-12 16:58:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2022-07-12 16:58:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 278 states have (on average 1.0539568345323742) internal successors, (293), 291 states have internal predecessors, (293), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 465 transitions. [2022-07-12 16:58:17,115 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 465 transitions. Word has length 255 [2022-07-12 16:58:17,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:17,116 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 465 transitions. [2022-07-12 16:58:17,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-12 16:58:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 465 transitions. [2022-07-12 16:58:17,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-07-12 16:58:17,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:17,117 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:17,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-12 16:58:17,118 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_linux_kernel_rcu_update_lock_bh_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)] === [2022-07-12 16:58:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:17,118 INFO L85 PathProgramCache]: Analyzing trace with hash 312603938, now seen corresponding path program 1 times [2022-07-12 16:58:17,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:17,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6778450] [2022-07-12 16:58:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:17,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:17,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 16:58:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:58:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:17,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:17,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6778450] [2022-07-12 16:58:17,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6778450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:17,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:17,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245814291] [2022-07-12 16:58:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:17,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:17,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:17,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:17,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:17,290 INFO L87 Difference]: Start difference. First operand 430 states and 465 transitions. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (40), 6 states have call predecessors, (40), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2022-07-12 16:58:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:17,852 INFO L93 Difference]: Finished difference Result 430 states and 465 transitions. [2022-07-12 16:58:17,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:17,853 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (40), 6 states have call predecessors, (40), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 261 [2022-07-12 16:58:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:17,855 INFO L225 Difference]: With dead ends: 430 [2022-07-12 16:58:17,855 INFO L226 Difference]: Without dead ends: 428 [2022-07-12 16:58:17,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:17,856 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 854 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:17,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 698 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-07-12 16:58:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2022-07-12 16:58:17,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 277 states have (on average 1.0505415162454874) internal successors, (291), 289 states have internal predecessors, (291), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 463 transitions. [2022-07-12 16:58:17,966 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 463 transitions. Word has length 261 [2022-07-12 16:58:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:17,966 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 463 transitions. [2022-07-12 16:58:17,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (40), 6 states have call predecessors, (40), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2022-07-12 16:58:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 463 transitions. [2022-07-12 16:58:17,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-12 16:58:17,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:17,968 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:17,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-12 16:58:17,968 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_linux_kernel_rcu_update_lock_sched_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)] === [2022-07-12 16:58:17,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1168433669, now seen corresponding path program 1 times [2022-07-12 16:58:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:17,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159390293] [2022-07-12 16:58:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 16:58:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:58:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 16:58:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,151 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:18,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159390293] [2022-07-12 16:58:18,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159390293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:18,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:18,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:18,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429155151] [2022-07-12 16:58:18,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:18,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:18,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:18,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:18,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:18,153 INFO L87 Difference]: Start difference. First operand 428 states and 463 transitions. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 4 states have internal predecessors, (134), 2 states have call successors, (41), 6 states have call predecessors, (41), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-12 16:58:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:18,725 INFO L93 Difference]: Finished difference Result 428 states and 463 transitions. [2022-07-12 16:58:18,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:18,726 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 4 states have internal predecessors, (134), 2 states have call successors, (41), 6 states have call predecessors, (41), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 267 [2022-07-12 16:58:18,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:18,728 INFO L225 Difference]: With dead ends: 428 [2022-07-12 16:58:18,728 INFO L226 Difference]: Without dead ends: 426 [2022-07-12 16:58:18,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:18,728 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 844 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:18,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 696 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-07-12 16:58:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-07-12 16:58:18,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 276 states have (on average 1.0471014492753623) internal successors, (289), 287 states have internal predecessors, (289), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 461 transitions. [2022-07-12 16:58:18,835 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 461 transitions. Word has length 267 [2022-07-12 16:58:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:18,835 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 461 transitions. [2022-07-12 16:58:18,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 4 states have internal predecessors, (134), 2 states have call successors, (41), 6 states have call predecessors, (41), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-12 16:58:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 461 transitions. [2022-07-12 16:58:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-07-12 16:58:18,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:18,837 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:18,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-12 16:58:18,837 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_linux_kernel_rcu_update_lock_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)] === [2022-07-12 16:58:18,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:18,837 INFO L85 PathProgramCache]: Analyzing trace with hash -645970940, now seen corresponding path program 1 times [2022-07-12 16:58:18,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:18,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725072227] [2022-07-12 16:58:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:18,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 16:58:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:58:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 16:58:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-12 16:58:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:19,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:19,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725072227] [2022-07-12 16:58:19,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725072227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:19,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:19,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:19,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403474047] [2022-07-12 16:58:19,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:19,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:19,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:19,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:19,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:19,045 INFO L87 Difference]: Start difference. First operand 426 states and 461 transitions. Second operand has 8 states, 8 states have (on average 17.25) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-12 16:58:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:19,609 INFO L93 Difference]: Finished difference Result 426 states and 461 transitions. [2022-07-12 16:58:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:19,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.25) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 273 [2022-07-12 16:58:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:19,611 INFO L225 Difference]: With dead ends: 426 [2022-07-12 16:58:19,612 INFO L226 Difference]: Without dead ends: 424 [2022-07-12 16:58:19,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:19,612 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 834 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:19,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 694 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:19,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-07-12 16:58:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2022-07-12 16:58:19,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 275 states have (on average 1.0436363636363637) internal successors, (287), 285 states have internal predecessors, (287), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2022-07-12 16:58:19,721 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 273 [2022-07-12 16:58:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:19,721 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2022-07-12 16:58:19,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.25) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-12 16:58:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2022-07-12 16:58:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-12 16:58:19,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:19,723 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:19,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-12 16:58:19,723 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_linux_kernel_rcu_srcu_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)] === [2022-07-12 16:58:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:19,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2010354461, now seen corresponding path program 1 times [2022-07-12 16:58:19,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:19,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473225868] [2022-07-12 16:58:19,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:19,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:19,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 16:58:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:58:19,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 16:58:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-12 16:58:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 16:58:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:19,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:19,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473225868] [2022-07-12 16:58:19,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473225868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:19,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:19,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:19,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80904355] [2022-07-12 16:58:19,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:19,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:19,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:19,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:19,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:19,962 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (43), 6 states have call predecessors, (43), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-12 16:58:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:20,596 INFO L93 Difference]: Finished difference Result 424 states and 459 transitions. [2022-07-12 16:58:20,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:20,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (43), 6 states have call predecessors, (43), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 279 [2022-07-12 16:58:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:20,599 INFO L225 Difference]: With dead ends: 424 [2022-07-12 16:58:20,599 INFO L226 Difference]: Without dead ends: 422 [2022-07-12 16:58:20,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:20,599 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 824 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:20,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 692 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:20,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-07-12 16:58:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2022-07-12 16:58:20,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 274 states have (on average 1.0401459854014599) internal successors, (285), 283 states have internal predecessors, (285), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:20,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 457 transitions. [2022-07-12 16:58:20,770 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 457 transitions. Word has length 279 [2022-07-12 16:58:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:20,770 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 457 transitions. [2022-07-12 16:58:20,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (43), 6 states have call predecessors, (43), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-12 16:58:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 457 transitions. [2022-07-12 16:58:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2022-07-12 16:58:20,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:20,772 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:20,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-12 16:58:20,772 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_linux_lib_idr_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)] === [2022-07-12 16:58:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:20,773 INFO L85 PathProgramCache]: Analyzing trace with hash -448659565, now seen corresponding path program 1 times [2022-07-12 16:58:20,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:20,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134844677] [2022-07-12 16:58:20,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:20,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:20,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 16:58:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:58:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 16:58:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-12 16:58:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 16:58:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-12 16:58:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:21,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:21,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134844677] [2022-07-12 16:58:21,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134844677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:21,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:21,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:21,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660726256] [2022-07-12 16:58:21,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:21,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:21,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:21,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:21,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:21,043 INFO L87 Difference]: Start difference. First operand 422 states and 457 transitions. Second operand has 8 states, 8 states have (on average 18.25) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (44), 6 states have call predecessors, (44), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2022-07-12 16:58:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:21,679 INFO L93 Difference]: Finished difference Result 422 states and 457 transitions. [2022-07-12 16:58:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:21,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (44), 6 states have call predecessors, (44), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 285 [2022-07-12 16:58:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:21,681 INFO L225 Difference]: With dead ends: 422 [2022-07-12 16:58:21,681 INFO L226 Difference]: Without dead ends: 420 [2022-07-12 16:58:21,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:21,682 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 814 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:21,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 690 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-07-12 16:58:21,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2022-07-12 16:58:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 273 states have (on average 1.0366300366300367) internal successors, (283), 281 states have internal predecessors, (283), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:21,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 455 transitions. [2022-07-12 16:58:21,799 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 455 transitions. Word has length 285 [2022-07-12 16:58:21,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:21,799 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 455 transitions. [2022-07-12 16:58:21,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (44), 6 states have call predecessors, (44), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2022-07-12 16:58:21,799 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 455 transitions. [2022-07-12 16:58:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2022-07-12 16:58:21,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:21,801 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:21,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-12 16:58:21,801 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_mmc_sdio_func_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)] === [2022-07-12 16:58:21,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:21,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2024722807, now seen corresponding path program 1 times [2022-07-12 16:58:21,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:21,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229030184] [2022-07-12 16:58:21,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:21,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:21,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:21,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 16:58:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:58:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 16:58:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-12 16:58:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 16:58:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-12 16:58:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 16:58:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,015 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:22,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:22,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229030184] [2022-07-12 16:58:22,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229030184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:22,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:22,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:22,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238760455] [2022-07-12 16:58:22,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:22,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:22,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:22,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:22,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:22,017 INFO L87 Difference]: Start difference. First operand 420 states and 455 transitions. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (45), 6 states have call predecessors, (45), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2022-07-12 16:58:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:22,643 INFO L93 Difference]: Finished difference Result 420 states and 455 transitions. [2022-07-12 16:58:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:22,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (45), 6 states have call predecessors, (45), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 291 [2022-07-12 16:58:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:22,645 INFO L225 Difference]: With dead ends: 420 [2022-07-12 16:58:22,645 INFO L226 Difference]: Without dead ends: 418 [2022-07-12 16:58:22,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:22,646 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 804 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:22,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 688 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:22,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-12 16:58:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2022-07-12 16:58:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 272 states have (on average 1.0330882352941178) internal successors, (281), 279 states have internal predecessors, (281), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 453 transitions. [2022-07-12 16:58:22,773 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 453 transitions. Word has length 291 [2022-07-12 16:58:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:22,773 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 453 transitions. [2022-07-12 16:58:22,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (45), 6 states have call predecessors, (45), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2022-07-12 16:58:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 453 transitions. [2022-07-12 16:58:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-07-12 16:58:22,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:22,775 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:22,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-12 16:58:22,776 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ldv_linux_net_rtnetlink_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)] === [2022-07-12 16:58:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:22,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2019577928, now seen corresponding path program 1 times [2022-07-12 16:58:22,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:22,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881655677] [2022-07-12 16:58:22,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:22,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 16:58:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:58:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 16:58:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-12 16:58:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 16:58:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-12 16:58:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 16:58:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-12 16:58:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:22,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:22,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881655677] [2022-07-12 16:58:22,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881655677] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:22,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:22,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:22,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859182051] [2022-07-12 16:58:22,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:22,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:22,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:22,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:22,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:22,978 INFO L87 Difference]: Start difference. First operand 418 states and 453 transitions. Second operand has 8 states, 8 states have (on average 19.25) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (46), 6 states have call predecessors, (46), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2022-07-12 16:58:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:23,591 INFO L93 Difference]: Finished difference Result 418 states and 453 transitions. [2022-07-12 16:58:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:23,592 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (46), 6 states have call predecessors, (46), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 297 [2022-07-12 16:58:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:23,593 INFO L225 Difference]: With dead ends: 418 [2022-07-12 16:58:23,593 INFO L226 Difference]: Without dead ends: 416 [2022-07-12 16:58:23,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:23,594 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 794 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:23,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 686 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-07-12 16:58:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2022-07-12 16:58:23,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 271 states have (on average 1.029520295202952) internal successors, (279), 277 states have internal predecessors, (279), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 451 transitions. [2022-07-12 16:58:23,707 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 451 transitions. Word has length 297 [2022-07-12 16:58:23,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:23,707 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 451 transitions. [2022-07-12 16:58:23,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (46), 6 states have call predecessors, (46), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2022-07-12 16:58:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 451 transitions. [2022-07-12 16:58:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2022-07-12 16:58:23,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:23,709 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:23,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-12 16:58:23,710 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ldv_linux_net_sock_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)] === [2022-07-12 16:58:23,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:23,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1543049479, now seen corresponding path program 1 times [2022-07-12 16:58:23,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:23,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535113755] [2022-07-12 16:58:23,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:23,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 16:58:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:58:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 16:58:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-12 16:58:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 16:58:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-12 16:58:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 16:58:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-12 16:58:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-12 16:58:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:23,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:23,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535113755] [2022-07-12 16:58:23,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535113755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:23,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:23,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475608901] [2022-07-12 16:58:23,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:23,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:23,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:23,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:23,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:23,949 INFO L87 Difference]: Start difference. First operand 416 states and 451 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (47), 6 states have call predecessors, (47), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2022-07-12 16:58:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:24,545 INFO L93 Difference]: Finished difference Result 416 states and 451 transitions. [2022-07-12 16:58:24,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:24,545 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (47), 6 states have call predecessors, (47), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 303 [2022-07-12 16:58:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:24,547 INFO L225 Difference]: With dead ends: 416 [2022-07-12 16:58:24,548 INFO L226 Difference]: Without dead ends: 414 [2022-07-12 16:58:24,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:24,548 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 784 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:24,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 684 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-12 16:58:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-07-12 16:58:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 270 states have (on average 1.025925925925926) internal successors, (277), 275 states have internal predecessors, (277), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 449 transitions. [2022-07-12 16:58:24,677 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 449 transitions. Word has length 303 [2022-07-12 16:58:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:24,678 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 449 transitions. [2022-07-12 16:58:24,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (47), 6 states have call predecessors, (47), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2022-07-12 16:58:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 449 transitions. [2022-07-12 16:58:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-12 16:58:24,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:24,680 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:24,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-12 16:58:24,680 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ldv_linux_usb_coherent_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)] === [2022-07-12 16:58:24,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:24,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1319340359, now seen corresponding path program 1 times [2022-07-12 16:58:24,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:24,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109348448] [2022-07-12 16:58:24,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:24,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 16:58:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:58:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 16:58:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-12 16:58:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 16:58:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-12 16:58:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 16:58:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-12 16:58:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-12 16:58:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-07-12 16:58:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:24,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:24,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109348448] [2022-07-12 16:58:24,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109348448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:24,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:24,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829526573] [2022-07-12 16:58:24,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:24,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:24,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:24,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:24,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:24,871 INFO L87 Difference]: Start difference. First operand 414 states and 449 transitions. Second operand has 8 states, 8 states have (on average 20.25) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (48), 6 states have call predecessors, (48), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-12 16:58:25,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:25,439 INFO L93 Difference]: Finished difference Result 414 states and 449 transitions. [2022-07-12 16:58:25,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:25,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (48), 6 states have call predecessors, (48), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 309 [2022-07-12 16:58:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:25,441 INFO L225 Difference]: With dead ends: 414 [2022-07-12 16:58:25,441 INFO L226 Difference]: Without dead ends: 412 [2022-07-12 16:58:25,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:25,442 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 774 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:25,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 682 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:25,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-07-12 16:58:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2022-07-12 16:58:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 269 states have (on average 1.0223048327137547) internal successors, (275), 273 states have internal predecessors, (275), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 447 transitions. [2022-07-12 16:58:25,548 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 447 transitions. Word has length 309 [2022-07-12 16:58:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:25,548 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 447 transitions. [2022-07-12 16:58:25,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (48), 6 states have call predecessors, (48), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-12 16:58:25,548 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 447 transitions. [2022-07-12 16:58:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-07-12 16:58:25,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:25,550 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:25,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-12 16:58:25,550 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ldv_linux_usb_gadget_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)] === [2022-07-12 16:58:25,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:25,550 INFO L85 PathProgramCache]: Analyzing trace with hash 642791397, now seen corresponding path program 1 times [2022-07-12 16:58:25,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:25,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793960772] [2022-07-12 16:58:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:25,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 16:58:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:58:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 16:58:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-12 16:58:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 16:58:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-12 16:58:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 16:58:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-12 16:58:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-12 16:58:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-07-12 16:58:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-12 16:58:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:25,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:25,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793960772] [2022-07-12 16:58:25,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793960772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:25,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:25,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 16:58:25,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619525939] [2022-07-12 16:58:25,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:25,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 16:58:25,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:25,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 16:58:25,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:25,772 INFO L87 Difference]: Start difference. First operand 412 states and 447 transitions. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 6 states have internal predecessors, (166), 2 states have call successors, (49), 6 states have call predecessors, (49), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2022-07-12 16:58:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:26,520 INFO L93 Difference]: Finished difference Result 412 states and 447 transitions. [2022-07-12 16:58:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 16:58:26,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 6 states have internal predecessors, (166), 2 states have call successors, (49), 6 states have call predecessors, (49), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 315 [2022-07-12 16:58:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:26,521 INFO L225 Difference]: With dead ends: 412 [2022-07-12 16:58:26,521 INFO L226 Difference]: Without dead ends: 410 [2022-07-12 16:58:26,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-07-12 16:58:26,522 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 778 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:26,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 912 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 16:58:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-12 16:58:26,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-07-12 16:58:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 268 states have (on average 1.0186567164179106) internal successors, (273), 271 states have internal predecessors, (273), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 16:58:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 445 transitions. [2022-07-12 16:58:26,631 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 445 transitions. Word has length 315 [2022-07-12 16:58:26,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:26,632 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 445 transitions. [2022-07-12 16:58:26,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 6 states have internal predecessors, (166), 2 states have call successors, (49), 6 states have call predecessors, (49), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2022-07-12 16:58:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 445 transitions. [2022-07-12 16:58:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-07-12 16:58:26,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:26,633 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:26,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-12 16:58:26,634 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ldv_linux_usb_urb_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)] === [2022-07-12 16:58:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1312174456, now seen corresponding path program 1 times [2022-07-12 16:58:26,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:26,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999282378] [2022-07-12 16:58:26,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:26,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 16:58:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 16:58:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 16:58:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 16:58:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 16:58:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 16:58:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 16:58:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 16:58:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 16:58:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 16:58:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:58:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:58:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-12 16:58:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-12 16:58:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-12 16:58:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-12 16:58:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-12 16:58:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-12 16:58:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-12 16:58:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-12 16:58:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-12 16:58:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-12 16:58:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-12 16:58:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-12 16:58:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-12 16:58:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 16:58:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-12 16:58:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-12 16:58:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-07-12 16:58:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-12 16:58:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-07-12 16:58:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-12 16:58:26,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:26,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999282378] [2022-07-12 16:58:26,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999282378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:26,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:26,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:26,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238871801] [2022-07-12 16:58:26,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:26,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:26,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:26,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:26,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:26,864 INFO L87 Difference]: Start difference. First operand 410 states and 445 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 4 states have internal predecessors, (170), 2 states have call successors, (50), 6 states have call predecessors, (50), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2022-07-12 16:58:27,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:27,475 INFO L93 Difference]: Finished difference Result 410 states and 445 transitions. [2022-07-12 16:58:27,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:27,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 4 states have internal predecessors, (170), 2 states have call successors, (50), 6 states have call predecessors, (50), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 321 [2022-07-12 16:58:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:27,476 INFO L225 Difference]: With dead ends: 410 [2022-07-12 16:58:27,476 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 16:58:27,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:58:27,477 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 751 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:27,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 679 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 16:58:27,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 16:58:27,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 16:58:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 16:58:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 16:58:27,478 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 321 [2022-07-12 16:58:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:27,478 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 16:58:27,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 4 states have internal predecessors, (170), 2 states have call successors, (50), 6 states have call predecessors, (50), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2022-07-12 16:58:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 16:58:27,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 16:58:27,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (28 of 29 remaining) [2022-07-12 16:58:27,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2022-07-12 16:58:27,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2022-07-12 16:58:27,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2022-07-12 16:58:27,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_fs_char_dev__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2022-07-12 16:58:27,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2022-07-12 16:58:27,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2022-07-12 16:58:27,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2022-07-12 16:58:27,482 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2022-07-12 16:58:27,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_drivers_base_class__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2022-07-12 16:58:27,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2022-07-12 16:58:27,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2022-07-12 16:58:27,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2022-07-12 16:58:27,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2022-07-12 16:58:27,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2022-07-12 16:58:27,483 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2022-07-12 16:58:27,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_gadget_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2022-07-12 16:58:27,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2022-07-12 16:58:27,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2022-07-12 16:58:27,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2022-07-12 16:58:27,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2022-07-12 16:58:27,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2022-07-12 16:58:27,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2022-07-12 16:58:27,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2022-07-12 16:58:27,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2022-07-12 16:58:27,484 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2022-07-12 16:58:27,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2022-07-12 16:58:27,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2022-07-12 16:58:27,485 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2022-07-12 16:58:27,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-12 16:58:27,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 16:59:53,450 WARN L233 SmtUtils]: Spent 1.31m on a formula simplification. DAG size of input: 281 DAG size of output: 279 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)