./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 ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 21c7509b891e0ddc87dd83939d0ee5cb835b3606a1a2de3064d905837c808c7b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:20:35,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:20:35,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:20:35,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:20:35,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:20:35,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:20:35,507 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:20:35,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:20:35,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:20:35,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:20:35,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:20:35,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:20:35,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:20:35,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:20:35,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:20:35,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:20:35,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:20:35,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:20:35,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:20:35,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:20:35,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:20:35,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:20:35,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:20:35,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:20:35,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:20:35,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:20:35,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:20:35,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:20:35,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:20:35,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:20:35,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:20:35,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:20:35,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:20:35,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:20:35,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:20:35,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:20:35,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:20:35,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:20:35,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:20:35,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:20:35,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:20:35,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 05:20:35,566 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:20:35,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:20:35,567 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:20:35,567 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:20:35,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:20:35,568 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:20:35,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:20:35,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:20:35,569 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:20:35,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:20:35,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:20:35,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:20:35,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 05:20:35,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:20:35,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 05:20:35,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 05:20:35,571 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:20:35,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 05:20:35,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:20:35,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:20:35,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:20:35,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:20:35,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:20:35,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:20:35,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 05:20:35,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:20:35,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:20:35,574 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 05:20:35,574 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 05:20:35,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 05:20:35,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 21c7509b891e0ddc87dd83939d0ee5cb835b3606a1a2de3064d905837c808c7b [2021-12-28 05:20:35,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:20:35,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:20:35,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:20:35,923 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:20:35,926 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:20:35,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2021-12-28 05:20:35,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bdc53278/c03b984c87c8469f8154fef6ca24ea07/FLAG113636f1c [2021-12-28 05:20:36,845 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:20:36,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2021-12-28 05:20:36,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bdc53278/c03b984c87c8469f8154fef6ca24ea07/FLAG113636f1c [2021-12-28 05:20:36,990 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bdc53278/c03b984c87c8469f8154fef6ca24ea07 [2021-12-28 05:20:36,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:20:36,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:20:36,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:20:36,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:20:37,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:20:37,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:20:36" (1/1) ... [2021-12-28 05:20:37,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11aed68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:37, skipping insertion in model container [2021-12-28 05:20:37,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:20:36" (1/1) ... [2021-12-28 05:20:37,009 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:20:37,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:20:39,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292064,292077] [2021-12-28 05:20:39,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292209,292222] [2021-12-28 05:20:39,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292355,292368] [2021-12-28 05:20:39,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292520,292533] [2021-12-28 05:20:39,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292678,292691] [2021-12-28 05:20:39,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292836,292849] [2021-12-28 05:20:39,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292994,293007] [2021-12-28 05:20:39,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293154,293167] [2021-12-28 05:20:39,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293313,293326] [2021-12-28 05:20:39,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293452,293465] [2021-12-28 05:20:39,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293594,293607] [2021-12-28 05:20:39,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293743,293756] [2021-12-28 05:20:39,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293882,293895] [2021-12-28 05:20:39,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294037,294050] [2021-12-28 05:20:39,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294197,294210] [2021-12-28 05:20:39,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294348,294361] [2021-12-28 05:20:39,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294499,294512] [2021-12-28 05:20:39,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294651,294664] [2021-12-28 05:20:39,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294800,294813] [2021-12-28 05:20:39,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294948,294961] [2021-12-28 05:20:39,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2021-12-28 05:20:39,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2021-12-28 05:20:39,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295410,295423] [2021-12-28 05:20:39,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295563,295576] [2021-12-28 05:20:39,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2021-12-28 05:20:39,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2021-12-28 05:20:39,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2021-12-28 05:20:39,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2021-12-28 05:20:39,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2021-12-28 05:20:39,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2021-12-28 05:20:39,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2021-12-28 05:20:39,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2021-12-28 05:20:39,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2021-12-28 05:20:39,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2021-12-28 05:20:39,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2021-12-28 05:20:39,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2021-12-28 05:20:39,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2021-12-28 05:20:39,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2021-12-28 05:20:39,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2021-12-28 05:20:39,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2021-12-28 05:20:39,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2021-12-28 05:20:39,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2021-12-28 05:20:39,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2021-12-28 05:20:39,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2021-12-28 05:20:39,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2021-12-28 05:20:39,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2021-12-28 05:20:39,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2021-12-28 05:20:39,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2021-12-28 05:20:39,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2021-12-28 05:20:39,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2021-12-28 05:20:39,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2021-12-28 05:20:39,427 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2021-12-28 05:20:39,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2021-12-28 05:20:39,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2021-12-28 05:20:39,428 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2021-12-28 05:20:39,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2021-12-28 05:20:39,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2021-12-28 05:20:39,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2021-12-28 05:20:39,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2021-12-28 05:20:39,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2021-12-28 05:20:39,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2021-12-28 05:20:39,431 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2021-12-28 05:20:39,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2021-12-28 05:20:39,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2021-12-28 05:20:39,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2021-12-28 05:20:39,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2021-12-28 05:20:39,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2021-12-28 05:20:39,433 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2021-12-28 05:20:39,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2021-12-28 05:20:39,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2021-12-28 05:20:39,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2021-12-28 05:20:39,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2021-12-28 05:20:39,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2021-12-28 05:20:39,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2021-12-28 05:20:39,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2021-12-28 05:20:39,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303542,303555] [2021-12-28 05:20:39,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303693,303706] [2021-12-28 05:20:39,437 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303844,303857] [2021-12-28 05:20:39,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303992,304005] [2021-12-28 05:20:39,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304158,304171] [2021-12-28 05:20:39,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304327,304340] [2021-12-28 05:20:39,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304494,304507] [2021-12-28 05:20:39,439 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304662,304675] [2021-12-28 05:20:39,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304812,304825] [2021-12-28 05:20:39,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304959,304972] [2021-12-28 05:20:39,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305120,305133] [2021-12-28 05:20:39,440 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305290,305303] [2021-12-28 05:20:39,441 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305452,305465] [2021-12-28 05:20:39,456 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:20:39,481 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:20:39,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292064,292077] [2021-12-28 05:20:39,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292209,292222] [2021-12-28 05:20:39,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292355,292368] [2021-12-28 05:20:39,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292520,292533] [2021-12-28 05:20:39,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292678,292691] [2021-12-28 05:20:39,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292836,292849] [2021-12-28 05:20:39,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292994,293007] [2021-12-28 05:20:39,714 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293154,293167] [2021-12-28 05:20:39,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293313,293326] [2021-12-28 05:20:39,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293452,293465] [2021-12-28 05:20:39,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293594,293607] [2021-12-28 05:20:39,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293743,293756] [2021-12-28 05:20:39,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293882,293895] [2021-12-28 05:20:39,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294037,294050] [2021-12-28 05:20:39,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294197,294210] [2021-12-28 05:20:39,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294348,294361] [2021-12-28 05:20:39,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294499,294512] [2021-12-28 05:20:39,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294651,294664] [2021-12-28 05:20:39,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294800,294813] [2021-12-28 05:20:39,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294948,294961] [2021-12-28 05:20:39,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2021-12-28 05:20:39,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2021-12-28 05:20:39,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295410,295423] [2021-12-28 05:20:39,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295563,295576] [2021-12-28 05:20:39,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2021-12-28 05:20:39,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2021-12-28 05:20:39,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2021-12-28 05:20:39,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2021-12-28 05:20:39,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2021-12-28 05:20:39,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2021-12-28 05:20:39,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2021-12-28 05:20:39,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2021-12-28 05:20:39,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2021-12-28 05:20:39,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2021-12-28 05:20:39,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2021-12-28 05:20:39,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2021-12-28 05:20:39,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2021-12-28 05:20:39,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2021-12-28 05:20:39,724 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2021-12-28 05:20:39,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2021-12-28 05:20:39,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2021-12-28 05:20:39,725 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2021-12-28 05:20:39,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2021-12-28 05:20:39,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2021-12-28 05:20:39,726 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2021-12-28 05:20:39,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2021-12-28 05:20:39,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2021-12-28 05:20:39,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2021-12-28 05:20:39,727 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2021-12-28 05:20:39,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2021-12-28 05:20:39,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2021-12-28 05:20:39,728 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2021-12-28 05:20:39,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2021-12-28 05:20:39,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2021-12-28 05:20:39,729 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2021-12-28 05:20:39,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2021-12-28 05:20:39,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2021-12-28 05:20:39,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2021-12-28 05:20:39,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2021-12-28 05:20:39,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2021-12-28 05:20:39,731 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2021-12-28 05:20:39,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2021-12-28 05:20:39,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2021-12-28 05:20:39,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2021-12-28 05:20:39,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2021-12-28 05:20:39,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2021-12-28 05:20:39,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2021-12-28 05:20:39,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2021-12-28 05:20:39,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2021-12-28 05:20:39,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2021-12-28 05:20:39,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2021-12-28 05:20:39,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2021-12-28 05:20:39,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2021-12-28 05:20:39,735 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2021-12-28 05:20:39,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2021-12-28 05:20:39,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303542,303555] [2021-12-28 05:20:39,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303693,303706] [2021-12-28 05:20:39,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303844,303857] [2021-12-28 05:20:39,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303992,304005] [2021-12-28 05:20:39,737 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304158,304171] [2021-12-28 05:20:39,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304327,304340] [2021-12-28 05:20:39,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304494,304507] [2021-12-28 05:20:39,738 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304662,304675] [2021-12-28 05:20:39,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304812,304825] [2021-12-28 05:20:39,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304959,304972] [2021-12-28 05:20:39,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305120,305133] [2021-12-28 05:20:39,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305290,305303] [2021-12-28 05:20:39,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305452,305465] [2021-12-28 05:20:39,742 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:20:39,915 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:20:39,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:39 WrapperNode [2021-12-28 05:20:39,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:20:39,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:20:39,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:20:39,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:20:39,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:39" (1/1) ... [2021-12-28 05:20:40,043 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:39" (1/1) ... [2021-12-28 05:20:40,122 INFO L137 Inliner]: procedures = 519, calls = 1770, calls flagged for inlining = 206, calls inlined = 55, statements flattened = 940 [2021-12-28 05:20:40,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:20:40,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:20:40,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:20:40,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:20:40,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:39" (1/1) ... [2021-12-28 05:20:40,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:39" (1/1) ... [2021-12-28 05:20:40,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:39" (1/1) ... [2021-12-28 05:20:40,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:39" (1/1) ... [2021-12-28 05:20:40,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:39" (1/1) ... [2021-12-28 05:20:40,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:39" (1/1) ... [2021-12-28 05:20:40,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:39" (1/1) ... [2021-12-28 05:20:40,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:20:40,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:20:40,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:20:40,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:20:40,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:39" (1/1) ... [2021-12-28 05:20:40,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:20:40,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:20:40,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 05:20:40,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 05:20:40,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_usb_gadget__class_registration_with_usb_gadget [2021-12-28 05:20:40,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_usb_gadget__class_registration_with_usb_gadget [2021-12-28 05:20:40,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2021-12-28 05:20:40,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2021-12-28 05:20:40,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-28 05:20:40,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-28 05:20:40,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-28 05:20:40,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-28 05:20:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-28 05:20:40,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-28 05:20:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-28 05:20:40,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-28 05:20:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-28 05:20:40,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-28 05:20:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-28 05:20:40,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-28 05:20:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-28 05:20:40,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-28 05:20:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-28 05:20:40,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-28 05:20:40,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-28 05:20:40,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-28 05:20:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-28 05:20:40,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-28 05:20:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 05:20:40,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-28 05:20:40,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-28 05:20:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-28 05:20:40,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-28 05:20:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_fs_char_dev__double_registration [2021-12-28 05:20:40,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_fs_char_dev__double_registration [2021-12-28 05:20:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-28 05:20:40,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-28 05:20:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-28 05:20:40,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-28 05:20:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:20:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:20:40,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-28 05:20:40,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-28 05:20:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-28 05:20:40,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-28 05:20:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:20:40,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:20:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2021-12-28 05:20:40,297 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2021-12-28 05:20:40,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-28 05:20:40,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-28 05:20:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_destroy_class [2021-12-28 05:20:40,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_destroy_class [2021-12-28 05:20:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-28 05:20:40,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-28 05:20:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-28 05:20:40,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-28 05:20:40,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-28 05:20:40,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-28 05:20:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_drivers_base_class__double_registration [2021-12-28 05:20:40,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_drivers_base_class__double_registration [2021-12-28 05:20:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_destroy_class [2021-12-28 05:20:40,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_destroy_class [2021-12-28 05:20:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 05:20:40,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-28 05:20:40,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-28 05:20:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-28 05:20:40,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-28 05:20:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-28 05:20:40,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-28 05:20:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-28 05:20:40,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-28 05:20:40,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-28 05:20:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-28 05:20:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-28 05:20:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-28 05:20:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-28 05:20:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-28 05:20:40,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-28 05:20:40,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-28 05:20:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-28 05:20:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-28 05:20:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:20:40,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadget [2021-12-28 05:20:40,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadget [2021-12-28 05:20:40,591 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:20:40,593 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:20:40,746 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-28 05:20:41,507 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:20:41,517 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:20:41,518 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 05:20:41,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:20:41 BoogieIcfgContainer [2021-12-28 05:20:41,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:20:41,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:20:41,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:20:41,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:20:41,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:20:36" (1/3) ... [2021-12-28 05:20:41,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3220ecd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:20:41, skipping insertion in model container [2021-12-28 05:20:41,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:20:39" (2/3) ... [2021-12-28 05:20:41,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3220ecd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:20:41, skipping insertion in model container [2021-12-28 05:20:41,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:20:41" (3/3) ... [2021-12-28 05:20:41,528 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2021-12-28 05:20:41,533 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:20:41,533 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2021-12-28 05:20:41,575 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:20:41,581 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 05:20:41,581 INFO L340 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2021-12-28 05:20:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 263 states have internal predecessors, (302), 77 states have call successors, (77), 37 states have call predecessors, (77), 36 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2021-12-28 05:20:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 05:20:41,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:41,611 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:41,611 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_drivers_base_class__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:20:41,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:41,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1456749468, now seen corresponding path program 1 times [2021-12-28 05:20:41,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:41,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951222208] [2021-12-28 05:20:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:41,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:42,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:42,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:20:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:42,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:42,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 05:20:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:42,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:20:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 05:20:42,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:42,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951222208] [2021-12-28 05:20:42,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951222208] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:42,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:42,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:20:42,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360994666] [2021-12-28 05:20:42,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:42,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:20:42,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:42,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:20:42,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:20:42,224 INFO L87 Difference]: Start difference. First operand has 374 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 263 states have internal predecessors, (302), 77 states have call successors, (77), 37 states have call predecessors, (77), 36 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 05:20:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:43,657 INFO L93 Difference]: Finished difference Result 1054 states and 1373 transitions. [2021-12-28 05:20:43,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:20:43,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2021-12-28 05:20:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:43,681 INFO L225 Difference]: With dead ends: 1054 [2021-12-28 05:20:43,682 INFO L226 Difference]: Without dead ends: 691 [2021-12-28 05:20:43,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:20:43,692 INFO L933 BasicCegarLoop]: 752 mSDtfsCounter, 539 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:43,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [607 Valid, 1491 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 05:20:43,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-12-28 05:20:43,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 480. [2021-12-28 05:20:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 302 states have (on average 1.1754966887417218) internal successors, (355), 336 states have internal predecessors, (355), 101 states have call successors, (101), 50 states have call predecessors, (101), 49 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2021-12-28 05:20:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 557 transitions. [2021-12-28 05:20:43,780 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 557 transitions. Word has length 35 [2021-12-28 05:20:43,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:43,781 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 557 transitions. [2021-12-28 05:20:43,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2021-12-28 05:20:43,781 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 557 transitions. [2021-12-28 05:20:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-28 05:20:43,783 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:43,784 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:43,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:20:43,784 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:20:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:43,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1101797720, now seen corresponding path program 1 times [2021-12-28 05:20:43,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:43,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762365605] [2021-12-28 05:20:43,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:43,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:43,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:43,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:43,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:20:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:43,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:43,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 05:20:43,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:43,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:20:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:43,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:20:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:43,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-28 05:20:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-28 05:20:43,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:43,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762365605] [2021-12-28 05:20:43,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762365605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:43,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:43,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:20:43,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522831159] [2021-12-28 05:20:43,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:43,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:20:43,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:43,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:20:43,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:20:43,991 INFO L87 Difference]: Start difference. First operand 480 states and 557 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 05:20:44,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:44,678 INFO L93 Difference]: Finished difference Result 482 states and 559 transitions. [2021-12-28 05:20:44,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:20:44,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2021-12-28 05:20:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:44,683 INFO L225 Difference]: With dead ends: 482 [2021-12-28 05:20:44,683 INFO L226 Difference]: Without dead ends: 480 [2021-12-28 05:20:44,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:20:44,685 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 508 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:44,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 743 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-28 05:20:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2021-12-28 05:20:44,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2021-12-28 05:20:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 301 states have (on average 1.169435215946844) internal successors, (352), 334 states have internal predecessors, (352), 101 states have call successors, (101), 50 states have call predecessors, (101), 49 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2021-12-28 05:20:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 554 transitions. [2021-12-28 05:20:44,728 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 554 transitions. Word has length 48 [2021-12-28 05:20:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:44,728 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 554 transitions. [2021-12-28 05:20:44,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 05:20:44,729 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 554 transitions. [2021-12-28 05:20:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-12-28 05:20:44,732 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:44,732 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:44,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:20:44,732 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_fs_char_dev__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:20:44,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 951373245, now seen corresponding path program 1 times [2021-12-28 05:20:44,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:44,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589235021] [2021-12-28 05:20:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:44,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:44,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:44,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:20:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:44,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:44,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 05:20:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:44,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:20:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:20:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:44,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-28 05:20:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:44,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:20:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:44,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-28 05:20:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:45,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:45,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 05:20:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:45,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:45,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-12-28 05:20:45,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:45,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589235021] [2021-12-28 05:20:45,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589235021] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:45,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:45,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:20:45,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676325457] [2021-12-28 05:20:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:45,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:20:45,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:45,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:20:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:20:45,044 INFO L87 Difference]: Start difference. First operand 478 states and 554 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-28 05:20:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:46,071 INFO L93 Difference]: Finished difference Result 821 states and 930 transitions. [2021-12-28 05:20:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:20:46,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2021-12-28 05:20:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:46,077 INFO L225 Difference]: With dead ends: 821 [2021-12-28 05:20:46,077 INFO L226 Difference]: Without dead ends: 819 [2021-12-28 05:20:46,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:20:46,079 INFO L933 BasicCegarLoop]: 468 mSDtfsCounter, 632 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:46,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [694 Valid, 918 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-28 05:20:46,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-12-28 05:20:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 672. [2021-12-28 05:20:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 432 states have (on average 1.1828703703703705) internal successors, (511), 467 states have internal predecessors, (511), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2021-12-28 05:20:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 785 transitions. [2021-12-28 05:20:46,124 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 785 transitions. Word has length 86 [2021-12-28 05:20:46,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:46,124 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 785 transitions. [2021-12-28 05:20:46,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2021-12-28 05:20:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 785 transitions. [2021-12-28 05:20:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-12-28 05:20:46,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:46,129 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:46,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:20:46,130 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:20:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:46,130 INFO L85 PathProgramCache]: Analyzing trace with hash -292723993, now seen corresponding path program 1 times [2021-12-28 05:20:46,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:46,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294885572] [2021-12-28 05:20:46,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:46,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:20:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 05:20:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:20:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:20:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-28 05:20:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:20:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-28 05:20:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 05:20:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:20:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:46,451 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-12-28 05:20:46,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:46,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294885572] [2021-12-28 05:20:46,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294885572] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:46,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:46,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:20:46,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648461522] [2021-12-28 05:20:46,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:46,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:20:46,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:46,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:20:46,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:20:46,454 INFO L87 Difference]: Start difference. First operand 672 states and 785 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 05:20:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:47,034 INFO L93 Difference]: Finished difference Result 674 states and 787 transitions. [2021-12-28 05:20:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:20:47,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2021-12-28 05:20:47,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:47,039 INFO L225 Difference]: With dead ends: 674 [2021-12-28 05:20:47,039 INFO L226 Difference]: Without dead ends: 672 [2021-12-28 05:20:47,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:20:47,041 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 487 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:47,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [543 Valid, 739 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 05:20:47,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2021-12-28 05:20:47,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 670. [2021-12-28 05:20:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 431 states have (on average 1.1763341067285382) internal successors, (507), 465 states have internal predecessors, (507), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2021-12-28 05:20:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 781 transitions. [2021-12-28 05:20:47,077 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 781 transitions. Word has length 105 [2021-12-28 05:20:47,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:47,077 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 781 transitions. [2021-12-28 05:20:47,078 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2021-12-28 05:20:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 781 transitions. [2021-12-28 05:20:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-28 05:20:47,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:47,081 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:47,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:20:47,081 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:20:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash -876569357, now seen corresponding path program 1 times [2021-12-28 05:20:47,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:47,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113131382] [2021-12-28 05:20:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:47,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:20:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 05:20:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:20:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:20:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-28 05:20:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:20:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-28 05:20:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-28 05:20:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:20:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:20:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:20:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:20:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-28 05:20:47,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:47,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113131382] [2021-12-28 05:20:47,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113131382] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:47,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:47,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:20:47,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299491935] [2021-12-28 05:20:47,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:47,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:20:47,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:47,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:20:47,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:20:47,330 INFO L87 Difference]: Start difference. First operand 670 states and 781 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-28 05:20:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:48,012 INFO L93 Difference]: Finished difference Result 672 states and 783 transitions. [2021-12-28 05:20:48,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:20:48,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2021-12-28 05:20:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:48,017 INFO L225 Difference]: With dead ends: 672 [2021-12-28 05:20:48,017 INFO L226 Difference]: Without dead ends: 670 [2021-12-28 05:20:48,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:20:48,018 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 838 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:48,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [888 Valid, 717 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-28 05:20:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-12-28 05:20:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2021-12-28 05:20:48,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 430 states have (on average 1.172093023255814) internal successors, (504), 463 states have internal predecessors, (504), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2021-12-28 05:20:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 778 transitions. [2021-12-28 05:20:48,053 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 778 transitions. Word has length 107 [2021-12-28 05:20:48,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:48,053 INFO L470 AbstractCegarLoop]: Abstraction has 668 states and 778 transitions. [2021-12-28 05:20:48,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2021-12-28 05:20:48,054 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 778 transitions. [2021-12-28 05:20:48,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-28 05:20:48,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:48,056 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:48,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:20:48,057 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:20:48,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:48,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1725971280, now seen corresponding path program 1 times [2021-12-28 05:20:48,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:48,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182360913] [2021-12-28 05:20:48,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:48,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:20:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 05:20:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:20:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:20:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-28 05:20:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:20:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-28 05:20:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-28 05:20:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:20:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:20:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:20:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:20:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:20:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-28 05:20:48,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:48,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182360913] [2021-12-28 05:20:48,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182360913] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:48,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:48,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:20:48,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898160663] [2021-12-28 05:20:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:48,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:20:48,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:48,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:20:48,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:20:48,311 INFO L87 Difference]: Start difference. First operand 668 states and 778 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-28 05:20:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:48,959 INFO L93 Difference]: Finished difference Result 670 states and 780 transitions. [2021-12-28 05:20:48,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:20:48,960 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2021-12-28 05:20:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:48,964 INFO L225 Difference]: With dead ends: 670 [2021-12-28 05:20:48,964 INFO L226 Difference]: Without dead ends: 668 [2021-12-28 05:20:48,965 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:20:48,965 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 830 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:48,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [879 Valid, 715 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 05:20:48,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-12-28 05:20:48,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2021-12-28 05:20:48,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 429 states have (on average 1.167832167832168) internal successors, (501), 461 states have internal predecessors, (501), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2021-12-28 05:20:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 775 transitions. [2021-12-28 05:20:48,998 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 775 transitions. Word has length 113 [2021-12-28 05:20:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:48,999 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 775 transitions. [2021-12-28 05:20:48,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-28 05:20:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 775 transitions. [2021-12-28 05:20:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-12-28 05:20:49,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:49,002 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:49,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:20:49,002 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:20:49,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:49,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1315263575, now seen corresponding path program 1 times [2021-12-28 05:20:49,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:49,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571402092] [2021-12-28 05:20:49,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:49,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:20:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 05:20:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:20:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:20:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-28 05:20:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:20:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-28 05:20:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-28 05:20:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:20:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:20:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:20:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:20:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-28 05:20:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-28 05:20:49,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:49,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571402092] [2021-12-28 05:20:49,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571402092] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:49,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:49,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-28 05:20:49,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257925613] [2021-12-28 05:20:49,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:49,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-28 05:20:49,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:49,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-28 05:20:49,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:20:49,404 INFO L87 Difference]: Start difference. First operand 666 states and 775 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-28 05:20:51,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:51,999 INFO L93 Difference]: Finished difference Result 1556 states and 1785 transitions. [2021-12-28 05:20:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 05:20:52,000 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) Word has length 114 [2021-12-28 05:20:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:52,007 INFO L225 Difference]: With dead ends: 1556 [2021-12-28 05:20:52,007 INFO L226 Difference]: Without dead ends: 1317 [2021-12-28 05:20:52,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2021-12-28 05:20:52,010 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 1539 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 3564 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 4432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 3564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:52,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1549 Valid, 1783 Invalid, 4432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 3564 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-28 05:20:52,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2021-12-28 05:20:52,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 902. [2021-12-28 05:20:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 587 states have (on average 1.161839863713799) internal successors, (682), 628 states have internal predecessors, (682), 188 states have call successors, (188), 104 states have call predecessors, (188), 104 states have return successors, (188), 178 states have call predecessors, (188), 186 states have call successors, (188) [2021-12-28 05:20:52,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1058 transitions. [2021-12-28 05:20:52,077 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1058 transitions. Word has length 114 [2021-12-28 05:20:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:52,077 INFO L470 AbstractCegarLoop]: Abstraction has 902 states and 1058 transitions. [2021-12-28 05:20:52,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2021-12-28 05:20:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1058 transitions. [2021-12-28 05:20:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-12-28 05:20:52,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:52,080 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:52,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:20:52,082 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:20:52,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:52,082 INFO L85 PathProgramCache]: Analyzing trace with hash -331086751, now seen corresponding path program 1 times [2021-12-28 05:20:52,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:52,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774166113] [2021-12-28 05:20:52,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:52,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:20:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 05:20:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:20:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:20:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-28 05:20:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:20:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-28 05:20:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 05:20:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 05:20:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:20:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:20:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-28 05:20:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:52,520 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2021-12-28 05:20:52,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:52,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774166113] [2021-12-28 05:20:52,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774166113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:52,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:52,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 05:20:52,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208602355] [2021-12-28 05:20:52,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:52,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 05:20:52,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:52,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 05:20:52,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:20:52,523 INFO L87 Difference]: Start difference. First operand 902 states and 1058 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2021-12-28 05:20:55,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:55,017 INFO L93 Difference]: Finished difference Result 1829 states and 2159 transitions. [2021-12-28 05:20:55,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:20:55,018 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 122 [2021-12-28 05:20:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:55,026 INFO L225 Difference]: With dead ends: 1829 [2021-12-28 05:20:55,027 INFO L226 Difference]: Without dead ends: 1329 [2021-12-28 05:20:55,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2021-12-28 05:20:55,031 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 846 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 3462 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 4253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 3462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:55,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [864 Valid, 2402 Invalid, 4253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 3462 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-28 05:20:55,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2021-12-28 05:20:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 887. [2021-12-28 05:20:55,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 575 states have (on average 1.151304347826087) internal successors, (662), 616 states have internal predecessors, (662), 185 states have call successors, (185), 104 states have call predecessors, (185), 104 states have return successors, (184), 175 states have call predecessors, (184), 183 states have call successors, (184) [2021-12-28 05:20:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1031 transitions. [2021-12-28 05:20:55,099 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1031 transitions. Word has length 122 [2021-12-28 05:20:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:55,099 INFO L470 AbstractCegarLoop]: Abstraction has 887 states and 1031 transitions. [2021-12-28 05:20:55,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2021-12-28 05:20:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1031 transitions. [2021-12-28 05:20:55,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-28 05:20:55,103 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:55,103 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:55,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:20:55,104 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:20:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1688734875, now seen corresponding path program 1 times [2021-12-28 05:20:55,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:55,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437362182] [2021-12-28 05:20:55,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:55,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:20:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 05:20:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-12-28 05:20:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:20:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-12-28 05:20:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-28 05:20:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-28 05:20:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-28 05:20:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:20:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 05:20:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:20:55,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:20:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:20:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2021-12-28 05:20:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2021-12-28 05:20:55,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:20:55,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437362182] [2021-12-28 05:20:55,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437362182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:20:55,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:20:55,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-12-28 05:20:55,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619138540] [2021-12-28 05:20:55,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:20:55,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-28 05:20:55,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:20:55,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-28 05:20:55,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2021-12-28 05:20:55,941 INFO L87 Difference]: Start difference. First operand 887 states and 1031 transitions. Second operand has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 22 states have internal predecessors, (65), 9 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2021-12-28 05:20:59,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:20:59,410 INFO L93 Difference]: Finished difference Result 1361 states and 1599 transitions. [2021-12-28 05:20:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-28 05:20:59,411 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 22 states have internal predecessors, (65), 9 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) Word has length 117 [2021-12-28 05:20:59,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:20:59,415 INFO L225 Difference]: With dead ends: 1361 [2021-12-28 05:20:59,415 INFO L226 Difference]: Without dead ends: 659 [2021-12-28 05:20:59,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=282, Invalid=2268, Unknown=0, NotChecked=0, Total=2550 [2021-12-28 05:20:59,419 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 855 mSDsluCounter, 3689 mSDsCounter, 0 mSdLazyCounter, 6808 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 4115 SdHoareTripleChecker+Invalid, 7362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 6808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:20:59,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [887 Valid, 4115 Invalid, 7362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 6808 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-28 05:20:59,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-12-28 05:20:59,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 608. [2021-12-28 05:20:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 391 states have (on average 1.156010230179028) internal successors, (452), 421 states have internal predecessors, (452), 124 states have call successors, (124), 71 states have call predecessors, (124), 70 states have return successors, (122), 119 states have call predecessors, (122), 122 states have call successors, (122) [2021-12-28 05:20:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 698 transitions. [2021-12-28 05:20:59,463 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 698 transitions. Word has length 117 [2021-12-28 05:20:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:20:59,464 INFO L470 AbstractCegarLoop]: Abstraction has 608 states and 698 transitions. [2021-12-28 05:20:59,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4074074074074074) internal successors, (65), 22 states have internal predecessors, (65), 9 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2021-12-28 05:20:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 698 transitions. [2021-12-28 05:20:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2021-12-28 05:20:59,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:20:59,466 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:20:59,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:20:59,466 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:20:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:20:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1120376943, now seen corresponding path program 1 times [2021-12-28 05:20:59,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:20:59,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580991798] [2021-12-28 05:20:59,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:20:59,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:20:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:59,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:20:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:20:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:20:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:59,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 05:20:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:59,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:20:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:20:59,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:21:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:21:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:21:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 05:21:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:21:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-28 05:21:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-28 05:21:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:21:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-28 05:21:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-28 05:21:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-28 05:21:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2021-12-28 05:21:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2021-12-28 05:21:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-28 05:21:00,173 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:21:00,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580991798] [2021-12-28 05:21:00,173 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580991798] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:21:00,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456463280] [2021-12-28 05:21:00,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:21:00,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:21:00,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:21:00,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:21:00,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 05:21:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:00,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 95 conjunts are in the unsatisfiable core [2021-12-28 05:21:00,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:21:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2021-12-28 05:21:01,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:21:01,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456463280] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:21:01,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 05:21:01,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [18] total 38 [2021-12-28 05:21:01,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015681046] [2021-12-28 05:21:01,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:21:01,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-28 05:21:01,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:21:01,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-28 05:21:01,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1317, Unknown=0, NotChecked=0, Total=1406 [2021-12-28 05:21:01,869 INFO L87 Difference]: Start difference. First operand 608 states and 698 transitions. Second operand has 23 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 18 states have internal predecessors, (67), 9 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) [2021-12-28 05:21:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:21:04,420 INFO L93 Difference]: Finished difference Result 1054 states and 1171 transitions. [2021-12-28 05:21:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-28 05:21:04,421 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 18 states have internal predecessors, (67), 9 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) Word has length 130 [2021-12-28 05:21:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:21:04,425 INFO L225 Difference]: With dead ends: 1054 [2021-12-28 05:21:04,425 INFO L226 Difference]: Without dead ends: 859 [2021-12-28 05:21:04,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=2955, Unknown=0, NotChecked=0, Total=3192 [2021-12-28 05:21:04,428 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 970 mSDsluCounter, 5587 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 5909 SdHoareTripleChecker+Invalid, 3425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 720 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:21:04,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [975 Valid, 5909 Invalid, 3425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [720 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-28 05:21:04,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-12-28 05:21:04,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 664. [2021-12-28 05:21:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 428 states have (on average 1.1518691588785046) internal successors, (493), 460 states have internal predecessors, (493), 135 states have call successors, (135), 79 states have call predecessors, (135), 78 states have return successors, (133), 128 states have call predecessors, (133), 133 states have call successors, (133) [2021-12-28 05:21:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 761 transitions. [2021-12-28 05:21:04,502 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 761 transitions. Word has length 130 [2021-12-28 05:21:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:21:04,503 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 761 transitions. [2021-12-28 05:21:04,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 18 states have internal predecessors, (67), 9 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (20), 9 states have call predecessors, (20), 8 states have call successors, (20) [2021-12-28 05:21:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 761 transitions. [2021-12-28 05:21:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-28 05:21:04,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:21:04,505 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:21:04,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 05:21:04,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-28 05:21:04,720 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:21:04,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:21:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1921822841, now seen corresponding path program 1 times [2021-12-28 05:21:04,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:21:04,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777858483] [2021-12-28 05:21:04,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:21:04,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:21:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:21:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:04,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:21:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 05:21:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:21:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:21:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:21:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:21:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 05:21:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 05:21:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-28 05:21:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-12-28 05:21:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 05:21:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:21:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-28 05:21:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:21:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-28 05:21:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-28 05:21:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,297 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-12-28 05:21:05,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:21:05,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777858483] [2021-12-28 05:21:05,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777858483] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:21:05,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373966406] [2021-12-28 05:21:05,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:21:05,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:21:05,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:21:05,300 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:21:05,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 05:21:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:05,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 1929 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-28 05:21:05,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:21:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 105 proven. 8 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2021-12-28 05:21:06,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:21:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2021-12-28 05:21:07,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373966406] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:21:07,240 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:21:07,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 33 [2021-12-28 05:21:07,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470859923] [2021-12-28 05:21:07,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:21:07,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-28 05:21:07,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:21:07,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-28 05:21:07,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2021-12-28 05:21:07,242 INFO L87 Difference]: Start difference. First operand 664 states and 761 transitions. Second operand has 33 states, 27 states have (on average 3.814814814814815) internal successors, (103), 23 states have internal predecessors, (103), 10 states have call successors, (40), 3 states have call predecessors, (40), 9 states have return successors, (41), 16 states have call predecessors, (41), 10 states have call successors, (41) [2021-12-28 05:21:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:21:10,174 INFO L93 Difference]: Finished difference Result 1270 states and 1451 transitions. [2021-12-28 05:21:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-28 05:21:10,175 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 3.814814814814815) internal successors, (103), 23 states have internal predecessors, (103), 10 states have call successors, (40), 3 states have call predecessors, (40), 9 states have return successors, (41), 16 states have call predecessors, (41), 10 states have call successors, (41) Word has length 138 [2021-12-28 05:21:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:21:10,178 INFO L225 Difference]: With dead ends: 1270 [2021-12-28 05:21:10,179 INFO L226 Difference]: Without dead ends: 651 [2021-12-28 05:21:10,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 292 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=1787, Unknown=0, NotChecked=0, Total=1980 [2021-12-28 05:21:10,181 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 576 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 4247 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 2287 SdHoareTripleChecker+Invalid, 4738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 4247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:21:10,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 2287 Invalid, 4738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 4247 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-28 05:21:10,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-12-28 05:21:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 650. [2021-12-28 05:21:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 419 states have (on average 1.1479713603818615) internal successors, (481), 448 states have internal predecessors, (481), 131 states have call successors, (131), 78 states have call predecessors, (131), 77 states have return successors, (129), 125 states have call predecessors, (129), 129 states have call successors, (129) [2021-12-28 05:21:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 741 transitions. [2021-12-28 05:21:10,263 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 741 transitions. Word has length 138 [2021-12-28 05:21:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:21:10,264 INFO L470 AbstractCegarLoop]: Abstraction has 650 states and 741 transitions. [2021-12-28 05:21:10,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 3.814814814814815) internal successors, (103), 23 states have internal predecessors, (103), 10 states have call successors, (40), 3 states have call predecessors, (40), 9 states have return successors, (41), 16 states have call predecessors, (41), 10 states have call successors, (41) [2021-12-28 05:21:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 741 transitions. [2021-12-28 05:21:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-12-28 05:21:10,266 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:21:10,266 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:21:10,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 05:21:10,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-28 05:21:10,484 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:21:10,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:21:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1252398581, now seen corresponding path program 1 times [2021-12-28 05:21:10,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:21:10,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077900192] [2021-12-28 05:21:10,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:21:10,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:21:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:21:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:21:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 05:21:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:21:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:21:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:21:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:21:10,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:21:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:21:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:21:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:21:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:21:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 05:21:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 05:21:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:21:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-28 05:21:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:21:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-28 05:21:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 05:21:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2021-12-28 05:21:10,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:21:10,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077900192] [2021-12-28 05:21:10,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077900192] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:21:10,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:21:10,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:21:10,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981149417] [2021-12-28 05:21:10,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:21:10,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:21:10,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:21:10,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:21:10,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:21:10,733 INFO L87 Difference]: Start difference. First operand 650 states and 741 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-28 05:21:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:21:11,558 INFO L93 Difference]: Finished difference Result 1062 states and 1200 transitions. [2021-12-28 05:21:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:21:11,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 149 [2021-12-28 05:21:11,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:21:11,564 INFO L225 Difference]: With dead ends: 1062 [2021-12-28 05:21:11,564 INFO L226 Difference]: Without dead ends: 1060 [2021-12-28 05:21:11,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:21:11,566 INFO L933 BasicCegarLoop]: 445 mSDtfsCounter, 569 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:21:11,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [620 Valid, 747 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-28 05:21:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2021-12-28 05:21:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 748. [2021-12-28 05:21:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 484 states have (on average 1.1363636363636365) internal successors, (550), 514 states have internal predecessors, (550), 149 states have call successors, (149), 92 states have call predecessors, (149), 93 states have return successors, (151), 143 states have call predecessors, (151), 147 states have call successors, (151) [2021-12-28 05:21:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 850 transitions. [2021-12-28 05:21:11,673 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 850 transitions. Word has length 149 [2021-12-28 05:21:11,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:21:11,673 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 850 transitions. [2021-12-28 05:21:11,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2021-12-28 05:21:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 850 transitions. [2021-12-28 05:21:11,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-28 05:21:11,675 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:21:11,676 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:21:11,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 05:21:11,676 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:21:11,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:21:11,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1777528727, now seen corresponding path program 1 times [2021-12-28 05:21:11,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:21:11,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542682369] [2021-12-28 05:21:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:21:11,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:21:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:21:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:21:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 05:21:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:21:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:21:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:21:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:21:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:21:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:21:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:21:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:21:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:21:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 05:21:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:21:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-28 05:21:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 05:21:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-28 05:21:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-28 05:21:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-28 05:21:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-28 05:21:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2021-12-28 05:21:11,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:21:11,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542682369] [2021-12-28 05:21:11,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542682369] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:21:11,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:21:11,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:21:11,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443801639] [2021-12-28 05:21:11,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:21:11,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:21:11,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:21:11,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:21:11,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:21:11,952 INFO L87 Difference]: Start difference. First operand 748 states and 850 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-28 05:21:12,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:21:12,644 INFO L93 Difference]: Finished difference Result 748 states and 850 transitions. [2021-12-28 05:21:12,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:21:12,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2021-12-28 05:21:12,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:21:12,649 INFO L225 Difference]: With dead ends: 748 [2021-12-28 05:21:12,650 INFO L226 Difference]: Without dead ends: 746 [2021-12-28 05:21:12,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:21:12,651 INFO L933 BasicCegarLoop]: 378 mSDtfsCounter, 803 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:21:12,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 700 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 05:21:12,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-12-28 05:21:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2021-12-28 05:21:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 483 states have (on average 1.1325051759834368) internal successors, (547), 512 states have internal predecessors, (547), 149 states have call successors, (149), 92 states have call predecessors, (149), 93 states have return successors, (151), 143 states have call predecessors, (151), 147 states have call successors, (151) [2021-12-28 05:21:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 847 transitions. [2021-12-28 05:21:12,742 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 847 transitions. Word has length 146 [2021-12-28 05:21:12,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:21:12,742 INFO L470 AbstractCegarLoop]: Abstraction has 746 states and 847 transitions. [2021-12-28 05:21:12,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2021-12-28 05:21:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 847 transitions. [2021-12-28 05:21:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2021-12-28 05:21:12,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:21:12,745 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:21:12,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 05:21:12,745 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_usb_gadget_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:21:12,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:21:12,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1550649940, now seen corresponding path program 1 times [2021-12-28 05:21:12,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:21:12,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506720979] [2021-12-28 05:21:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:21:12,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:21:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:21:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:21:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 05:21:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:21:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:21:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:21:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:21:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:21:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:21:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:21:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:21:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:21:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 05:21:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 05:21:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:21:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-28 05:21:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:21:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-28 05:21:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-28 05:21:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-28 05:21:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2021-12-28 05:21:12,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:21:12,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506720979] [2021-12-28 05:21:12,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506720979] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:21:12,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:21:12,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:21:12,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435020212] [2021-12-28 05:21:12,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:21:12,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:21:12,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:21:12,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:21:12,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:21:12,997 INFO L87 Difference]: Start difference. First operand 746 states and 847 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-28 05:21:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:21:13,759 INFO L93 Difference]: Finished difference Result 756 states and 861 transitions. [2021-12-28 05:21:13,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:21:13,760 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 154 [2021-12-28 05:21:13,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:21:13,763 INFO L225 Difference]: With dead ends: 756 [2021-12-28 05:21:13,763 INFO L226 Difference]: Without dead ends: 754 [2021-12-28 05:21:13,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:21:13,765 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 636 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:21:13,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [693 Valid, 882 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-28 05:21:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-12-28 05:21:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 744. [2021-12-28 05:21:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 482 states have (on average 1.1224066390041494) internal successors, (541), 510 states have internal predecessors, (541), 149 states have call successors, (149), 92 states have call predecessors, (149), 93 states have return successors, (151), 143 states have call predecessors, (151), 147 states have call successors, (151) [2021-12-28 05:21:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 841 transitions. [2021-12-28 05:21:13,858 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 841 transitions. Word has length 154 [2021-12-28 05:21:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:21:13,858 INFO L470 AbstractCegarLoop]: Abstraction has 744 states and 841 transitions. [2021-12-28 05:21:13,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (23), 4 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2021-12-28 05:21:13,859 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 841 transitions. [2021-12-28 05:21:13,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-12-28 05:21:13,861 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:21:13,862 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:21:13,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 05:21:13,862 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:21:13,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:21:13,862 INFO L85 PathProgramCache]: Analyzing trace with hash -608956573, now seen corresponding path program 1 times [2021-12-28 05:21:13,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:21:13,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22805163] [2021-12-28 05:21:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:21:13,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:21:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:21:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:21:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 05:21:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:21:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:21:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:21:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:21:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:21:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:21:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:21:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:21:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:21:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 05:21:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 05:21:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-28 05:21:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-28 05:21:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2021-12-28 05:21:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2021-12-28 05:21:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-28 05:21:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:21:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 05:21:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2021-12-28 05:21:14,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:21:14,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22805163] [2021-12-28 05:21:14,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22805163] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:21:14,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175026024] [2021-12-28 05:21:14,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:21:14,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:21:14,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:21:14,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:21:14,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 05:21:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:14,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 1952 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-28 05:21:14,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:21:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-28 05:21:15,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:21:16,788 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-12-28 05:21:16,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175026024] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:21:16,789 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:21:16,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 15] total 48 [2021-12-28 05:21:16,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270522741] [2021-12-28 05:21:16,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:21:16,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-28 05:21:16,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:21:16,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-28 05:21:16,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=2143, Unknown=0, NotChecked=0, Total=2256 [2021-12-28 05:21:16,791 INFO L87 Difference]: Start difference. First operand 744 states and 841 transitions. Second operand has 48 states, 43 states have (on average 3.953488372093023) internal successors, (170), 38 states have internal predecessors, (170), 18 states have call successors, (63), 6 states have call predecessors, (63), 10 states have return successors, (65), 22 states have call predecessors, (65), 18 states have call successors, (65) [2021-12-28 05:21:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:21:22,452 INFO L93 Difference]: Finished difference Result 943 states and 1062 transitions. [2021-12-28 05:21:22,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-28 05:21:22,453 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 43 states have (on average 3.953488372093023) internal successors, (170), 38 states have internal predecessors, (170), 18 states have call successors, (63), 6 states have call predecessors, (63), 10 states have return successors, (65), 22 states have call predecessors, (65), 18 states have call successors, (65) Word has length 150 [2021-12-28 05:21:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:21:22,456 INFO L225 Difference]: With dead ends: 943 [2021-12-28 05:21:22,456 INFO L226 Difference]: Without dead ends: 694 [2021-12-28 05:21:22,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=587, Invalid=5733, Unknown=0, NotChecked=0, Total=6320 [2021-12-28 05:21:22,459 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 1662 mSDsluCounter, 3417 mSDsCounter, 0 mSdLazyCounter, 8891 mSolverCounterSat, 1253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 3718 SdHoareTripleChecker+Invalid, 10144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1253 IncrementalHoareTripleChecker+Valid, 8891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:21:22,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1664 Valid, 3718 Invalid, 10144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1253 Valid, 8891 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2021-12-28 05:21:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2021-12-28 05:21:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2021-12-28 05:21:22,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 447 states have (on average 1.1230425055928412) internal successors, (502), 477 states have internal predecessors, (502), 138 states have call successors, (138), 84 states have call predecessors, (138), 89 states have return successors, (144), 134 states have call predecessors, (144), 136 states have call successors, (144) [2021-12-28 05:21:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 784 transitions. [2021-12-28 05:21:22,610 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 784 transitions. Word has length 150 [2021-12-28 05:21:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:21:22,611 INFO L470 AbstractCegarLoop]: Abstraction has 694 states and 784 transitions. [2021-12-28 05:21:22,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 43 states have (on average 3.953488372093023) internal successors, (170), 38 states have internal predecessors, (170), 18 states have call successors, (63), 6 states have call predecessors, (63), 10 states have return successors, (65), 22 states have call predecessors, (65), 18 states have call successors, (65) [2021-12-28 05:21:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 784 transitions. [2021-12-28 05:21:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-12-28 05:21:22,614 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:21:22,614 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:21:22,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-28 05:21:22,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:21:22,828 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:21:22,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:21:22,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1422412358, now seen corresponding path program 1 times [2021-12-28 05:21:22,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:21:22,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844681581] [2021-12-28 05:21:22,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:21:22,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:21:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:21:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:21:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 05:21:22,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:21:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:21:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:21:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:21:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:21:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:21:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:21:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:21:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:21:22,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 05:21:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 05:21:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:22,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:21:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-28 05:21:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:21:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-28 05:21:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 05:21:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2021-12-28 05:21:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-28 05:21:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2021-12-28 05:21:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-28 05:21:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-28 05:21:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2021-12-28 05:21:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:21:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2021-12-28 05:21:23,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:21:23,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844681581] [2021-12-28 05:21:23,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844681581] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:21:23,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:21:23,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 05:21:23,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141529654] [2021-12-28 05:21:23,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:21:23,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-28 05:21:23,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:21:23,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-28 05:21:23,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:21:23,092 INFO L87 Difference]: Start difference. First operand 694 states and 784 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2021-12-28 05:21:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:21:24,476 INFO L93 Difference]: Finished difference Result 969 states and 1095 transitions. [2021-12-28 05:21:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:21:24,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 195 [2021-12-28 05:21:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:21:24,480 INFO L225 Difference]: With dead ends: 969 [2021-12-28 05:21:24,481 INFO L226 Difference]: Without dead ends: 699 [2021-12-28 05:21:24,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2021-12-28 05:21:24,483 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 774 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:21:24,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [801 Valid, 1573 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 05:21:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-12-28 05:21:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 672. [2021-12-28 05:21:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 435 states have (on average 1.1218390804597702) internal successors, (488), 462 states have internal predecessors, (488), 130 states have call successors, (130), 84 states have call predecessors, (130), 87 states have return successors, (133), 127 states have call predecessors, (133), 128 states have call successors, (133) [2021-12-28 05:21:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 751 transitions. [2021-12-28 05:21:24,611 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 751 transitions. Word has length 195 [2021-12-28 05:21:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:21:24,612 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 751 transitions. [2021-12-28 05:21:24,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 7 states have internal predecessors, (87), 3 states have call successors, (29), 5 states have call predecessors, (29), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2021-12-28 05:21:24,613 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 751 transitions. [2021-12-28 05:21:24,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-12-28 05:21:24,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:21:24,615 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:21:24,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 05:21:24,616 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:21:24,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:21:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1500690336, now seen corresponding path program 1 times [2021-12-28 05:21:24,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:21:24,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914557959] [2021-12-28 05:21:24,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:21:24,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:21:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:21:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:21:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 05:21:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:21:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:21:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:21:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:21:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:21:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:21:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:21:24,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:21:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:21:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 05:21:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 05:21:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:21:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:21:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 05:21:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:21:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-28 05:21:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-28 05:21:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-28 05:21:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-28 05:21:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2021-12-28 05:21:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2021-12-28 05:21:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2021-12-28 05:21:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2021-12-28 05:21:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:21:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:24,886 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2021-12-28 05:21:24,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:21:24,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914557959] [2021-12-28 05:21:24,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914557959] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:21:24,886 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:21:24,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:21:24,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404942102] [2021-12-28 05:21:24,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:21:24,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:21:24,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:21:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:21:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:21:24,888 INFO L87 Difference]: Start difference. First operand 672 states and 751 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-12-28 05:21:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:21:25,906 INFO L93 Difference]: Finished difference Result 711 states and 772 transitions. [2021-12-28 05:21:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:21:25,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 201 [2021-12-28 05:21:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:21:25,910 INFO L225 Difference]: With dead ends: 711 [2021-12-28 05:21:25,910 INFO L226 Difference]: Without dead ends: 709 [2021-12-28 05:21:25,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-12-28 05:21:25,911 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 1479 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-28 05:21:25,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1522 Valid, 877 Invalid, 1455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-28 05:21:25,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2021-12-28 05:21:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 670. [2021-12-28 05:21:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 434 states have (on average 1.119815668202765) internal successors, (486), 460 states have internal predecessors, (486), 130 states have call successors, (130), 84 states have call predecessors, (130), 87 states have return successors, (133), 127 states have call predecessors, (133), 128 states have call successors, (133) [2021-12-28 05:21:26,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 749 transitions. [2021-12-28 05:21:26,033 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 749 transitions. Word has length 201 [2021-12-28 05:21:26,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:21:26,034 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 749 transitions. [2021-12-28 05:21:26,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (30), 5 states have call predecessors, (30), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2021-12-28 05:21:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 749 transitions. [2021-12-28 05:21:26,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2021-12-28 05:21:26,040 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:21:26,041 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:21:26,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 05:21:26,041 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2021-12-28 05:21:26,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:21:26,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1991896125, now seen corresponding path program 1 times [2021-12-28 05:21:26,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:21:26,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982509973] [2021-12-28 05:21:26,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:21:26,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:21:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:21:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 05:21:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 05:21:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:21:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:21:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 05:21:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-12-28 05:21:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 05:21:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:21:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 05:21:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:21:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:21:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-12-28 05:21:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2021-12-28 05:21:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:21:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-28 05:21:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:21:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:21:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2021-12-28 05:21:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2021-12-28 05:21:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:21:26,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2021-12-28 05:21:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat