./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--input--touchscreen--usbtouchscreen.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.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 5d89cb3fe17476fb77f955111c8be961ec22d7c54b25abb5567bc8089a881883 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 16:55:59,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 16:55:59,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 16:55:59,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 16:55:59,144 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 16:55:59,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 16:55:59,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 16:55:59,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 16:55:59,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 16:55:59,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 16:55:59,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 16:55:59,158 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 16:55:59,158 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 16:55:59,160 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 16:55:59,161 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 16:55:59,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 16:55:59,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 16:55:59,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 16:55:59,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 16:55:59,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 16:55:59,172 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 16:55:59,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 16:55:59,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 16:55:59,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 16:55:59,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 16:55:59,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 16:55:59,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 16:55:59,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 16:55:59,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 16:55:59,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 16:55:59,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 16:55:59,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 16:55:59,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 16:55:59,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 16:55:59,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 16:55:59,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 16:55:59,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 16:55:59,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 16:55:59,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 16:55:59,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 16:55:59,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 16:55:59,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 16:55:59,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 16:55:59,227 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 16:55:59,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 16:55:59,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 16:55:59,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 16:55:59,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 16:55:59,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 16:55:59,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 16:55:59,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 16:55:59,230 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 16:55:59,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 16:55:59,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 16:55:59,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 16:55:59,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 16:55:59,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 16:55:59,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 16:55:59,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 16:55:59,232 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 16:55:59,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 16:55:59,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 16:55:59,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 16:55:59,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 16:55:59,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:55:59,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 16:55:59,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 16:55:59,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 16:55:59,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 16:55:59,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 16:55:59,235 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 16:55:59,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 16:55:59,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 16:55:59,236 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 -> 5d89cb3fe17476fb77f955111c8be961ec22d7c54b25abb5567bc8089a881883 [2022-07-12 16:55:59,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 16:55:59,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 16:55:59,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 16:55:59,464 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 16:55:59,465 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 16:55:59,466 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--input--touchscreen--usbtouchscreen.ko.cil.i [2022-07-12 16:55:59,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e05d719/835f9e3e9f14466fbfc5c99ef1c6232f/FLAG58b19b9d7 [2022-07-12 16:56:00,294 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 16:56:00,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i [2022-07-12 16:56:00,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e05d719/835f9e3e9f14466fbfc5c99ef1c6232f/FLAG58b19b9d7 [2022-07-12 16:56:00,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4e05d719/835f9e3e9f14466fbfc5c99ef1c6232f [2022-07-12 16:56:00,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 16:56:00,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 16:56:00,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 16:56:00,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 16:56:00,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 16:56:00,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:56:00" (1/1) ... [2022-07-12 16:56:00,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4766c019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:00, skipping insertion in model container [2022-07-12 16:56:00,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:56:00" (1/1) ... [2022-07-12 16:56:00,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 16:56:00,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 16:56:03,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[391473,391486] [2022-07-12 16:56:03,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[391618,391631] [2022-07-12 16:56:03,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[391764,391777] [2022-07-12 16:56:03,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[391929,391942] [2022-07-12 16:56:03,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392087,392100] [2022-07-12 16:56:03,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392245,392258] [2022-07-12 16:56:03,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392403,392416] [2022-07-12 16:56:03,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392563,392576] [2022-07-12 16:56:03,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392722,392735] [2022-07-12 16:56:03,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392861,392874] [2022-07-12 16:56:03,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393003,393016] [2022-07-12 16:56:03,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393152,393165] [2022-07-12 16:56:03,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393291,393304] [2022-07-12 16:56:03,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393446,393459] [2022-07-12 16:56:03,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393606,393619] [2022-07-12 16:56:03,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393757,393770] [2022-07-12 16:56:03,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393908,393921] [2022-07-12 16:56:03,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394060,394073] [2022-07-12 16:56:03,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394209,394222] [2022-07-12 16:56:03,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394357,394370] [2022-07-12 16:56:03,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394514,394527] [2022-07-12 16:56:03,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394663,394676] [2022-07-12 16:56:03,508 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394819,394832] [2022-07-12 16:56:03,509 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394972,394985] [2022-07-12 16:56:03,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395118,395131] [2022-07-12 16:56:03,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395261,395274] [2022-07-12 16:56:03,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395413,395426] [2022-07-12 16:56:03,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395559,395572] [2022-07-12 16:56:03,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395704,395717] [2022-07-12 16:56:03,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395858,395871] [2022-07-12 16:56:03,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396009,396022] [2022-07-12 16:56:03,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396164,396177] [2022-07-12 16:56:03,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396316,396329] [2022-07-12 16:56:03,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396471,396484] [2022-07-12 16:56:03,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396635,396648] [2022-07-12 16:56:03,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396791,396804] [2022-07-12 16:56:03,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396955,396968] [2022-07-12 16:56:03,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397097,397110] [2022-07-12 16:56:03,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397255,397268] [2022-07-12 16:56:03,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397422,397435] [2022-07-12 16:56:03,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397581,397594] [2022-07-12 16:56:03,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397740,397753] [2022-07-12 16:56:03,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397889,397902] [2022-07-12 16:56:03,523 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398036,398049] [2022-07-12 16:56:03,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398175,398188] [2022-07-12 16:56:03,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398338,398351] [2022-07-12 16:56:03,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398504,398517] [2022-07-12 16:56:03,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398668,398681] [2022-07-12 16:56:03,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398833,398846] [2022-07-12 16:56:03,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398998,399011] [2022-07-12 16:56:03,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[399164,399177] [2022-07-12 16:56:03,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[399329,399342] [2022-07-12 16:56:03,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[399496,399509] [2022-07-12 16:56:03,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[399656,399669] [2022-07-12 16:56:03,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[399818,399831] [2022-07-12 16:56:03,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[399977,399990] [2022-07-12 16:56:03,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400123,400136] [2022-07-12 16:56:03,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400266,400279] [2022-07-12 16:56:03,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400410,400423] [2022-07-12 16:56:03,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400553,400566] [2022-07-12 16:56:03,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400697,400710] [2022-07-12 16:56:03,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400838,400851] [2022-07-12 16:56:03,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400976,400989] [2022-07-12 16:56:03,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[401134,401147] [2022-07-12 16:56:03,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[401293,401306] [2022-07-12 16:56:03,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[401449,401462] [2022-07-12 16:56:03,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[401598,401611] [2022-07-12 16:56:03,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[401750,401763] [2022-07-12 16:56:03,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[401901,401914] [2022-07-12 16:56:03,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402050,402063] [2022-07-12 16:56:03,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402202,402215] [2022-07-12 16:56:03,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402350,402363] [2022-07-12 16:56:03,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402503,402516] [2022-07-12 16:56:03,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402654,402667] [2022-07-12 16:56:03,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402804,402817] [2022-07-12 16:56:03,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402951,402964] [2022-07-12 16:56:03,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[403102,403115] [2022-07-12 16:56:03,536 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[403253,403266] [2022-07-12 16:56:03,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[403401,403414] [2022-07-12 16:56:03,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[403567,403580] [2022-07-12 16:56:03,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[403736,403749] [2022-07-12 16:56:03,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[403903,403916] [2022-07-12 16:56:03,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[404071,404084] [2022-07-12 16:56:03,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[404221,404234] [2022-07-12 16:56:03,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[404368,404381] [2022-07-12 16:56:03,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[404529,404542] [2022-07-12 16:56:03,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[404699,404712] [2022-07-12 16:56:03,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[404861,404874] [2022-07-12 16:56:03,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:56:03,598 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 16:56:03,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[391473,391486] [2022-07-12 16:56:03,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[391618,391631] [2022-07-12 16:56:03,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[391764,391777] [2022-07-12 16:56:03,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[391929,391942] [2022-07-12 16:56:03,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392087,392100] [2022-07-12 16:56:03,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392245,392258] [2022-07-12 16:56:03,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392403,392416] [2022-07-12 16:56:03,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392563,392576] [2022-07-12 16:56:03,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392722,392735] [2022-07-12 16:56:03,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392861,392874] [2022-07-12 16:56:03,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393003,393016] [2022-07-12 16:56:03,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393152,393165] [2022-07-12 16:56:03,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393291,393304] [2022-07-12 16:56:03,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393446,393459] [2022-07-12 16:56:03,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393606,393619] [2022-07-12 16:56:03,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393757,393770] [2022-07-12 16:56:03,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393908,393921] [2022-07-12 16:56:03,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394060,394073] [2022-07-12 16:56:03,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394209,394222] [2022-07-12 16:56:03,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394357,394370] [2022-07-12 16:56:03,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394514,394527] [2022-07-12 16:56:03,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394663,394676] [2022-07-12 16:56:03,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394819,394832] [2022-07-12 16:56:03,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394972,394985] [2022-07-12 16:56:03,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395118,395131] [2022-07-12 16:56:03,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395261,395274] [2022-07-12 16:56:03,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395413,395426] [2022-07-12 16:56:03,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395559,395572] [2022-07-12 16:56:03,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395704,395717] [2022-07-12 16:56:04,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395858,395871] [2022-07-12 16:56:04,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396009,396022] [2022-07-12 16:56:04,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396164,396177] [2022-07-12 16:56:04,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396316,396329] [2022-07-12 16:56:04,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396471,396484] [2022-07-12 16:56:04,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396635,396648] [2022-07-12 16:56:04,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396791,396804] [2022-07-12 16:56:04,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396955,396968] [2022-07-12 16:56:04,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397097,397110] [2022-07-12 16:56:04,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397255,397268] [2022-07-12 16:56:04,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397422,397435] [2022-07-12 16:56:04,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397581,397594] [2022-07-12 16:56:04,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397740,397753] [2022-07-12 16:56:04,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397889,397902] [2022-07-12 16:56:04,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398036,398049] [2022-07-12 16:56:04,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398175,398188] [2022-07-12 16:56:04,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398338,398351] [2022-07-12 16:56:04,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398504,398517] [2022-07-12 16:56:04,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398668,398681] [2022-07-12 16:56:04,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398833,398846] [2022-07-12 16:56:04,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[398998,399011] [2022-07-12 16:56:04,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[399164,399177] [2022-07-12 16:56:04,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[399329,399342] [2022-07-12 16:56:04,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[399496,399509] [2022-07-12 16:56:04,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[399656,399669] [2022-07-12 16:56:04,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[399818,399831] [2022-07-12 16:56:04,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[399977,399990] [2022-07-12 16:56:04,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400123,400136] [2022-07-12 16:56:04,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400266,400279] [2022-07-12 16:56:04,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400410,400423] [2022-07-12 16:56:04,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400553,400566] [2022-07-12 16:56:04,015 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400697,400710] [2022-07-12 16:56:04,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400838,400851] [2022-07-12 16:56:04,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[400976,400989] [2022-07-12 16:56:04,019 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[401134,401147] [2022-07-12 16:56:04,020 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[401293,401306] [2022-07-12 16:56:04,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[401449,401462] [2022-07-12 16:56:04,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[401598,401611] [2022-07-12 16:56:04,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[401750,401763] [2022-07-12 16:56:04,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[401901,401914] [2022-07-12 16:56:04,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402050,402063] [2022-07-12 16:56:04,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402202,402215] [2022-07-12 16:56:04,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402350,402363] [2022-07-12 16:56:04,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402503,402516] [2022-07-12 16:56:04,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402654,402667] [2022-07-12 16:56:04,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402804,402817] [2022-07-12 16:56:04,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[402951,402964] [2022-07-12 16:56:04,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[403102,403115] [2022-07-12 16:56:04,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[403253,403266] [2022-07-12 16:56:04,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[403401,403414] [2022-07-12 16:56:04,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[403567,403580] [2022-07-12 16:56:04,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[403736,403749] [2022-07-12 16:56:04,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[403903,403916] [2022-07-12 16:56:04,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[404071,404084] [2022-07-12 16:56:04,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[404221,404234] [2022-07-12 16:56:04,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[404368,404381] [2022-07-12 16:56:04,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[404529,404542] [2022-07-12 16:56:04,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[404699,404712] [2022-07-12 16:56:04,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[404861,404874] [2022-07-12 16:56:04,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:56:04,335 INFO L208 MainTranslator]: Completed translation [2022-07-12 16:56:04,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:04 WrapperNode [2022-07-12 16:56:04,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 16:56:04,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 16:56:04,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 16:56:04,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 16:56:04,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:04" (1/1) ... [2022-07-12 16:56:04,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:04" (1/1) ... [2022-07-12 16:56:04,674 INFO L137 Inliner]: procedures = 624, calls = 2749, calls flagged for inlining = 307, calls inlined = 233, statements flattened = 6410 [2022-07-12 16:56:04,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 16:56:04,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 16:56:04,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 16:56:04,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 16:56:04,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:04" (1/1) ... [2022-07-12 16:56:04,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:04" (1/1) ... [2022-07-12 16:56:04,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:04" (1/1) ... [2022-07-12 16:56:04,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:04" (1/1) ... [2022-07-12 16:56:04,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:04" (1/1) ... [2022-07-12 16:56:04,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:04" (1/1) ... [2022-07-12 16:56:04,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:04" (1/1) ... [2022-07-12 16:56:05,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 16:56:05,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 16:56:05,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 16:56:05,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 16:56:05,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:04" (1/1) ... [2022-07-12 16:56:05,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:56:05,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:56:05,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 16:56:05,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 16:56:05,076 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:56:05,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:56:05,076 INFO L130 BoogieDeclarations]: Found specification of procedure mtouch_init [2022-07-12 16:56:05,077 INFO L138 BoogieDeclarations]: Found implementation of procedure mtouch_init [2022-07-12 16:56:05,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-12 16:56:05,077 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-12 16:56:05,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 16:56:05,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 16:56:05,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:56:05,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:56:05,077 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-07-12 16:56:05,078 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-07-12 16:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-12 16:56:05,078 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-12 16:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure idealtek_get_pkt_len [2022-07-12 16:56:05,078 INFO L138 BoogieDeclarations]: Found implementation of procedure idealtek_get_pkt_len [2022-07-12 16:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:56:05,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:56:05,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:56:05,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:56:05,079 INFO L130 BoogieDeclarations]: Found specification of procedure eturbo_read_data [2022-07-12 16:56:05,079 INFO L138 BoogieDeclarations]: Found implementation of procedure eturbo_read_data [2022-07-12 16:56:05,079 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-07-12 16:56:05,079 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-07-12 16:56:05,079 INFO L130 BoogieDeclarations]: Found specification of procedure eturbo_get_pkt_len [2022-07-12 16:56:05,079 INFO L138 BoogieDeclarations]: Found implementation of procedure eturbo_get_pkt_len [2022-07-12 16:56:05,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_input_dev [2022-07-12 16:56:05,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_input_dev [2022-07-12 16:56:05,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 16:56:05,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 16:56:05,080 INFO L130 BoogieDeclarations]: Found specification of procedure mtouch_read_data [2022-07-12 16:56:05,080 INFO L138 BoogieDeclarations]: Found implementation of procedure mtouch_read_data [2022-07-12 16:56:05,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 16:56:05,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 16:56:05,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:56:05,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:56:05,081 INFO L130 BoogieDeclarations]: Found specification of procedure e2i_init [2022-07-12 16:56:05,081 INFO L138 BoogieDeclarations]: Found implementation of procedure e2i_init [2022-07-12 16:56:05,081 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_probe [2022-07-12 16:56:05,081 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_probe [2022-07-12 16:56:05,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 16:56:05,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_input_dev [2022-07-12 16:56:05,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_input_dev [2022-07-12 16:56:05,082 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 16:56:05,082 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 16:56:05,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:56:05,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:56:05,082 INFO L130 BoogieDeclarations]: Found specification of procedure e2i_read_data [2022-07-12 16:56:05,082 INFO L138 BoogieDeclarations]: Found implementation of procedure e2i_read_data [2022-07-12 16:56:05,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 16:56:05,083 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_multi [2022-07-12 16:56:05,083 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_multi [2022-07-12 16:56:05,083 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-12 16:56:05,083 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-12 16:56:05,083 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-12 16:56:05,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-12 16:56:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure egalax_init [2022-07-12 16:56:05,084 INFO L138 BoogieDeclarations]: Found implementation of procedure egalax_init [2022-07-12 16:56:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 16:56:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 16:56:05,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 16:56:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 16:56:05,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 16:56:05,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:56:05,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:56:05,085 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-12 16:56:05,085 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-12 16:56:05,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 16:56:05,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:56:05,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:56:05,085 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-12 16:56:05,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-12 16:56:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 16:56:05,089 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 16:56:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:56:05,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:56:05,089 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 16:56:05,090 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 16:56:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 16:56:05,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 16:56:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure kstrdup [2022-07-12 16:56:05,091 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrdup [2022-07-12 16:56:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:56:05,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:56:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure panjit_read_data [2022-07-12 16:56:05,092 INFO L138 BoogieDeclarations]: Found implementation of procedure panjit_read_data [2022-07-12 16:56:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_alloc [2022-07-12 16:56:05,092 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_alloc [2022-07-12 16:56:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:56:05,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:56:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure etouch_get_pkt_len [2022-07-12 16:56:05,092 INFO L138 BoogieDeclarations]: Found implementation of procedure etouch_get_pkt_len [2022-07-12 16:56:05,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 16:56:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure elo_read_data [2022-07-12 16:56:05,093 INFO L138 BoogieDeclarations]: Found implementation of procedure elo_read_data [2022-07-12 16:56:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_free_buffers [2022-07-12 16:56:05,093 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_free_buffers [2022-07-12 16:56:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure general_touch_read_data [2022-07-12 16:56:05,093 INFO L138 BoogieDeclarations]: Found implementation of procedure general_touch_read_data [2022-07-12 16:56:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 16:56:05,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 16:56:05,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 16:56:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 16:56:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 16:56:05,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 16:56:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:56:05,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:56:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-12 16:56:05,094 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-12 16:56:05,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 16:56:05,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 16:56:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2022-07-12 16:56:05,095 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2022-07-12 16:56:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:56:05,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:56:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-12 16:56:05,095 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-12 16:56:05,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 16:56:05,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 16:56:05,096 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-12 16:56:05,096 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-12 16:56:05,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 16:56:05,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 16:56:05,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 16:56:05,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 16:56:05,097 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_resume [2022-07-12 16:56:05,097 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_resume [2022-07-12 16:56:05,097 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-12 16:56:05,097 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-12 16:56:05,097 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-12 16:56:05,098 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-12 16:56:05,098 INFO L130 BoogieDeclarations]: Found specification of procedure zytronic_read_data [2022-07-12 16:56:05,098 INFO L138 BoogieDeclarations]: Found implementation of procedure zytronic_read_data [2022-07-12 16:56:05,098 INFO L130 BoogieDeclarations]: Found specification of procedure gunze_read_data [2022-07-12 16:56:05,098 INFO L138 BoogieDeclarations]: Found implementation of procedure gunze_read_data [2022-07-12 16:56:05,098 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_disconnect [2022-07-12 16:56:05,098 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_disconnect [2022-07-12 16:56:05,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:56:05,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:56:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure tc45usb_read_data [2022-07-12 16:56:05,099 INFO L138 BoogieDeclarations]: Found implementation of procedure tc45usb_read_data [2022-07-12 16:56:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 16:56:05,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 16:56:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:56:05,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:56:05,099 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_exit [2022-07-12 16:56:05,099 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_exit [2022-07-12 16:56:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 16:56:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:56:05,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:56:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_init [2022-07-12 16:56:05,100 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_init [2022-07-12 16:56:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 16:56:05,100 INFO L130 BoogieDeclarations]: Found specification of procedure gotop_read_data [2022-07-12 16:56:05,100 INFO L138 BoogieDeclarations]: Found implementation of procedure gotop_read_data [2022-07-12 16:56:05,101 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-12 16:56:05,101 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-12 16:56:05,101 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2022-07-12 16:56:05,101 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2022-07-12 16:56:05,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 16:56:05,101 INFO L130 BoogieDeclarations]: Found specification of procedure jastec_read_data [2022-07-12 16:56:05,101 INFO L138 BoogieDeclarations]: Found implementation of procedure jastec_read_data [2022-07-12 16:56:05,101 INFO L130 BoogieDeclarations]: Found specification of procedure egalax_get_pkt_len [2022-07-12 16:56:05,102 INFO L138 BoogieDeclarations]: Found implementation of procedure egalax_get_pkt_len [2022-07-12 16:56:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure etouch_read_data [2022-07-12 16:56:05,102 INFO L138 BoogieDeclarations]: Found implementation of procedure etouch_read_data [2022-07-12 16:56:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 16:56:05,102 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 16:56:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-12 16:56:05,102 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-12 16:56:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:56:05,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:56:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_irq [2022-07-12 16:56:05,103 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_irq [2022-07-12 16:56:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 16:56:05,103 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 16:56:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 16:56:05,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 16:56:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_read_data [2022-07-12 16:56:05,147 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_read_data [2022-07-12 16:56:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 16:56:05,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 16:56:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2022-07-12 16:56:05,147 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2022-07-12 16:56:05,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 16:56:05,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 16:56:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 16:56:05,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 16:56:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-12 16:56:05,148 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-12 16:56:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:56:05,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:56:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:56:05,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:56:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:56:05,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:56:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure itm_read_data [2022-07-12 16:56:05,148 INFO L138 BoogieDeclarations]: Found implementation of procedure itm_read_data [2022-07-12 16:56:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 16:56:05,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 16:56:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:56:05,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:56:05,148 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-12 16:56:05,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-12 16:56:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 16:56:05,149 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 16:56:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:56:05,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:56:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_reset_resume [2022-07-12 16:56:05,149 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_reset_resume [2022-07-12 16:56:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 16:56:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:56:05,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:56:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 16:56:05,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 16:56:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:56:05,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:56:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-12 16:56:05,149 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-12 16:56:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 16:56:05,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 16:56:05,149 INFO L130 BoogieDeclarations]: Found specification of procedure idealtek_read_data [2022-07-12 16:56:05,150 INFO L138 BoogieDeclarations]: Found implementation of procedure idealtek_read_data [2022-07-12 16:56:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:56:05,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:56:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 16:56:05,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 16:56:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_pkt [2022-07-12 16:56:05,150 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_pkt [2022-07-12 16:56:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 16:56:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure irtouch_read_data [2022-07-12 16:56:05,150 INFO L138 BoogieDeclarations]: Found implementation of procedure irtouch_read_data [2022-07-12 16:56:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure egalax_read_data [2022-07-12 16:56:05,150 INFO L138 BoogieDeclarations]: Found implementation of procedure egalax_read_data [2022-07-12 16:56:05,984 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 16:56:05,987 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 16:56:06,242 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 16:56:11,124 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 16:56:11,139 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 16:56:11,139 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 16:56:11,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:56:11 BoogieIcfgContainer [2022-07-12 16:56:11,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 16:56:11,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 16:56:11,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 16:56:11,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 16:56:11,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:56:00" (1/3) ... [2022-07-12 16:56:11,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582e8c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:56:11, skipping insertion in model container [2022-07-12 16:56:11,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:56:04" (2/3) ... [2022-07-12 16:56:11,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582e8c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:56:11, skipping insertion in model container [2022-07-12 16:56:11,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:56:11" (3/3) ... [2022-07-12 16:56:11,150 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i [2022-07-12 16:56:11,162 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 16:56:11,163 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-12 16:56:11,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 16:56:11,255 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@30cf1f1d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@75831c28 [2022-07-12 16:56:11,255 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-12 16:56:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand has 2081 states, 1373 states have (on average 1.2949745083758193) internal successors, (1778), 1482 states have internal predecessors, (1778), 570 states have call successors, (570), 109 states have call predecessors, (570), 108 states have return successors, (550), 513 states have call predecessors, (550), 550 states have call successors, (550) [2022-07-12 16:56:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 16:56:11,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:11,274 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:11,274 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:56:11,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:11,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1025561447, now seen corresponding path program 1 times [2022-07-12 16:56:11,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:11,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847947765] [2022-07-12 16:56:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:12,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:12,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:56:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:12,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:56:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:12,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:12,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:56:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:56:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:12,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:12,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:56:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:12,323 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:12,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:12,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847947765] [2022-07-12 16:56:12,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847947765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:12,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:12,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:12,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710154278] [2022-07-12 16:56:12,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:12,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:12,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:12,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:12,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:12,359 INFO L87 Difference]: Start difference. First operand has 2081 states, 1373 states have (on average 1.2949745083758193) internal successors, (1778), 1482 states have internal predecessors, (1778), 570 states have call successors, (570), 109 states have call predecessors, (570), 108 states have return successors, (550), 513 states have call predecessors, (550), 550 states have call successors, (550) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 16:56:18,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:18,138 INFO L93 Difference]: Finished difference Result 4114 states and 5903 transitions. [2022-07-12 16:56:18,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:18,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2022-07-12 16:56:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:18,178 INFO L225 Difference]: With dead ends: 4114 [2022-07-12 16:56:18,178 INFO L226 Difference]: Without dead ends: 2048 [2022-07-12 16:56:18,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:18,202 INFO L413 NwaCegarLoop]: 2628 mSDtfsCounter, 4192 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 2062 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4502 SdHoareTripleChecker+Valid, 4979 SdHoareTripleChecker+Invalid, 4789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2062 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:18,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4502 Valid, 4979 Invalid, 4789 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2062 Valid, 2727 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-12 16:56:18,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2022-07-12 16:56:18,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2022-07-12 16:56:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1363 states have (on average 1.2582538517975055) internal successors, (1715), 1452 states have internal predecessors, (1715), 550 states have call successors, (550), 108 states have call predecessors, (550), 107 states have return successors, (548), 511 states have call predecessors, (548), 548 states have call successors, (548) [2022-07-12 16:56:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2813 transitions. [2022-07-12 16:56:18,424 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2813 transitions. Word has length 71 [2022-07-12 16:56:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:18,427 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2813 transitions. [2022-07-12 16:56:18,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 16:56:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2813 transitions. [2022-07-12 16:56:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 16:56:18,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:18,432 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:18,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 16:56:18,433 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:56:18,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash 331542922, now seen corresponding path program 1 times [2022-07-12 16:56:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:18,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400403724] [2022-07-12 16:56:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:18,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:18,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:18,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:56:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:18,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:56:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:18,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:18,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:56:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:56:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:18,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:18,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:56:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:18,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:18,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:18,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400403724] [2022-07-12 16:56:18,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400403724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:18,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:18,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:18,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387421605] [2022-07-12 16:56:18,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:18,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:18,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:18,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:18,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:18,978 INFO L87 Difference]: Start difference. First operand 2048 states and 2813 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 16:56:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:23,590 INFO L93 Difference]: Finished difference Result 2048 states and 2813 transitions. [2022-07-12 16:56:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:23,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2022-07-12 16:56:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:23,603 INFO L225 Difference]: With dead ends: 2048 [2022-07-12 16:56:23,603 INFO L226 Difference]: Without dead ends: 2046 [2022-07-12 16:56:23,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:23,606 INFO L413 NwaCegarLoop]: 2578 mSDtfsCounter, 4128 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4435 SdHoareTripleChecker+Valid, 4849 SdHoareTripleChecker+Invalid, 4735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:23,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4435 Valid, 4849 Invalid, 4735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-12 16:56:23,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2022-07-12 16:56:23,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2046. [2022-07-12 16:56:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2046 states, 1362 states have (on average 1.2577092511013215) internal successors, (1713), 1450 states have internal predecessors, (1713), 550 states have call successors, (550), 108 states have call predecessors, (550), 107 states have return successors, (548), 511 states have call predecessors, (548), 548 states have call successors, (548) [2022-07-12 16:56:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2811 transitions. [2022-07-12 16:56:23,709 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2811 transitions. Word has length 77 [2022-07-12 16:56:23,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:23,711 INFO L495 AbstractCegarLoop]: Abstraction has 2046 states and 2811 transitions. [2022-07-12 16:56:23,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 16:56:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2811 transitions. [2022-07-12 16:56:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 16:56:23,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:23,717 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:23,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 16:56:23,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:56:23,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:23,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1730925904, now seen corresponding path program 1 times [2022-07-12 16:56:23,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:23,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181564521] [2022-07-12 16:56:23,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:23,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:56:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:56:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:56:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:56:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:56:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:24,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:24,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181564521] [2022-07-12 16:56:24,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181564521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:24,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:24,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:24,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276794293] [2022-07-12 16:56:24,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:24,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:24,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:24,198 INFO L87 Difference]: Start difference. First operand 2046 states and 2811 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 16:56:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:29,007 INFO L93 Difference]: Finished difference Result 2046 states and 2811 transitions. [2022-07-12 16:56:29,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:29,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2022-07-12 16:56:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:29,018 INFO L225 Difference]: With dead ends: 2046 [2022-07-12 16:56:29,018 INFO L226 Difference]: Without dead ends: 2044 [2022-07-12 16:56:29,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:29,020 INFO L413 NwaCegarLoop]: 2576 mSDtfsCounter, 4122 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4428 SdHoareTripleChecker+Valid, 4847 SdHoareTripleChecker+Invalid, 4733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:29,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4428 Valid, 4847 Invalid, 4733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-12 16:56:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2022-07-12 16:56:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2022-07-12 16:56:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1361 states have (on average 1.2571638501102131) internal successors, (1711), 1448 states have internal predecessors, (1711), 550 states have call successors, (550), 108 states have call predecessors, (550), 107 states have return successors, (548), 511 states have call predecessors, (548), 548 states have call successors, (548) [2022-07-12 16:56:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2809 transitions. [2022-07-12 16:56:29,101 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2809 transitions. Word has length 83 [2022-07-12 16:56:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:29,102 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2809 transitions. [2022-07-12 16:56:29,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 16:56:29,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2809 transitions. [2022-07-12 16:56:29,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 16:56:29,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:29,104 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:29,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 16:56:29,104 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:56:29,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:29,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1404582892, now seen corresponding path program 1 times [2022-07-12 16:56:29,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:29,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394314381] [2022-07-12 16:56:29,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:29,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:56:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:56:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:56:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:56:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:56:29,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:29,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:29,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394314381] [2022-07-12 16:56:29,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394314381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:29,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:29,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:29,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589888635] [2022-07-12 16:56:29,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:29,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:29,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:29,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:29,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:29,502 INFO L87 Difference]: Start difference. First operand 2044 states and 2809 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:56:33,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:33,801 INFO L93 Difference]: Finished difference Result 2044 states and 2809 transitions. [2022-07-12 16:56:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:33,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2022-07-12 16:56:33,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:33,812 INFO L225 Difference]: With dead ends: 2044 [2022-07-12 16:56:33,812 INFO L226 Difference]: Without dead ends: 2042 [2022-07-12 16:56:33,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:33,814 INFO L413 NwaCegarLoop]: 2574 mSDtfsCounter, 4116 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2709 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4421 SdHoareTripleChecker+Valid, 4845 SdHoareTripleChecker+Invalid, 4731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:33,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4421 Valid, 4845 Invalid, 4731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2709 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-12 16:56:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2022-07-12 16:56:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2022-07-12 16:56:33,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1360 states have (on average 1.2566176470588235) internal successors, (1709), 1446 states have internal predecessors, (1709), 550 states have call successors, (550), 108 states have call predecessors, (550), 107 states have return successors, (548), 511 states have call predecessors, (548), 548 states have call successors, (548) [2022-07-12 16:56:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2807 transitions. [2022-07-12 16:56:33,889 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2807 transitions. Word has length 89 [2022-07-12 16:56:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:33,890 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 2807 transitions. [2022-07-12 16:56:33,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:56:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2807 transitions. [2022-07-12 16:56:33,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 16:56:33,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:33,895 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:33,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 16:56:33,897 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:56:33,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:33,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1494357745, now seen corresponding path program 1 times [2022-07-12 16:56:33,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:33,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846084367] [2022-07-12 16:56:33,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:33,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:56:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:56:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:56:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:56:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:56:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:56:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:34,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:34,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846084367] [2022-07-12 16:56:34,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846084367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:34,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:34,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:34,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366244841] [2022-07-12 16:56:34,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:34,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:34,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:34,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:34,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:34,359 INFO L87 Difference]: Start difference. First operand 2042 states and 2807 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 16:56:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:38,528 INFO L93 Difference]: Finished difference Result 2042 states and 2807 transitions. [2022-07-12 16:56:38,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:38,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2022-07-12 16:56:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:38,540 INFO L225 Difference]: With dead ends: 2042 [2022-07-12 16:56:38,541 INFO L226 Difference]: Without dead ends: 2040 [2022-07-12 16:56:38,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:38,543 INFO L413 NwaCegarLoop]: 2572 mSDtfsCounter, 4110 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2707 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4414 SdHoareTripleChecker+Valid, 4843 SdHoareTripleChecker+Invalid, 4729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:38,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4414 Valid, 4843 Invalid, 4729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2707 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 16:56:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2022-07-12 16:56:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 2040. [2022-07-12 16:56:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2040 states, 1359 states have (on average 1.2560706401766004) internal successors, (1707), 1444 states have internal predecessors, (1707), 550 states have call successors, (550), 108 states have call predecessors, (550), 107 states have return successors, (548), 511 states have call predecessors, (548), 548 states have call successors, (548) [2022-07-12 16:56:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2805 transitions. [2022-07-12 16:56:38,636 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2805 transitions. Word has length 95 [2022-07-12 16:56:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:38,636 INFO L495 AbstractCegarLoop]: Abstraction has 2040 states and 2805 transitions. [2022-07-12 16:56:38,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 16:56:38,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2805 transitions. [2022-07-12 16:56:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 16:56:38,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:38,638 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:38,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 16:56:38,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:56:38,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:38,639 INFO L85 PathProgramCache]: Analyzing trace with hash -996249196, now seen corresponding path program 1 times [2022-07-12 16:56:38,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:38,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795533585] [2022-07-12 16:56:38,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:38,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:56:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:56:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:56:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:56:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:39,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:56:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:39,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:39,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:56:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:39,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:39,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795533585] [2022-07-12 16:56:39,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795533585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:39,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:39,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:39,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250863191] [2022-07-12 16:56:39,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:39,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:39,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:39,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:39,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:39,098 INFO L87 Difference]: Start difference. First operand 2040 states and 2805 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 16:56:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:43,085 INFO L93 Difference]: Finished difference Result 2040 states and 2805 transitions. [2022-07-12 16:56:43,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:43,086 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2022-07-12 16:56:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:43,096 INFO L225 Difference]: With dead ends: 2040 [2022-07-12 16:56:43,097 INFO L226 Difference]: Without dead ends: 2038 [2022-07-12 16:56:43,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:43,099 INFO L413 NwaCegarLoop]: 2570 mSDtfsCounter, 4104 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4407 SdHoareTripleChecker+Valid, 4841 SdHoareTripleChecker+Invalid, 4727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:43,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4407 Valid, 4841 Invalid, 4727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 16:56:43,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2022-07-12 16:56:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 2038. [2022-07-12 16:56:43,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2038 states, 1358 states have (on average 1.2555228276877761) internal successors, (1705), 1442 states have internal predecessors, (1705), 550 states have call successors, (550), 108 states have call predecessors, (550), 107 states have return successors, (548), 511 states have call predecessors, (548), 548 states have call successors, (548) [2022-07-12 16:56:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2803 transitions. [2022-07-12 16:56:43,183 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2803 transitions. Word has length 101 [2022-07-12 16:56:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:43,184 INFO L495 AbstractCegarLoop]: Abstraction has 2038 states and 2803 transitions. [2022-07-12 16:56:43,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 16:56:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2803 transitions. [2022-07-12 16:56:43,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 16:56:43,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:43,186 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:43,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 16:56:43,186 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:56:43,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:43,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2062134940, now seen corresponding path program 1 times [2022-07-12 16:56:43,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:43,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680019659] [2022-07-12 16:56:43,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:43,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:56:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:56:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:56:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:56:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:56:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:43,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:56:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:56:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:56:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 16:56:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 16:56:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 16:56:44,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:44,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680019659] [2022-07-12 16:56:44,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680019659] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:56:44,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206951700] [2022-07-12 16:56:44,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:44,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:56:44,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:56:44,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:56:44,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 16:56:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:45,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 3969 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 16:56:45,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:56:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 16:56:45,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 16:56:45,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206951700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:45,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 16:56:45,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [21] total 31 [2022-07-12 16:56:45,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061326600] [2022-07-12 16:56:45,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:45,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 16:56:45,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:45,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 16:56:45,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2022-07-12 16:56:45,528 INFO L87 Difference]: Start difference. First operand 2038 states and 2803 transitions. Second operand has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 7 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-07-12 16:56:46,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:46,451 INFO L93 Difference]: Finished difference Result 4106 states and 5659 transitions. [2022-07-12 16:56:46,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 16:56:46,452 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 7 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) Word has length 116 [2022-07-12 16:56:46,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:46,465 INFO L225 Difference]: With dead ends: 4106 [2022-07-12 16:56:46,466 INFO L226 Difference]: Without dead ends: 2082 [2022-07-12 16:56:46,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=1569, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 16:56:46,477 INFO L413 NwaCegarLoop]: 2800 mSDtfsCounter, 90 mSDsluCounter, 44458 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 47258 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:46,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 47258 Invalid, 948 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [278 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 16:56:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-07-12 16:56:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2058. [2022-07-12 16:56:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 1372 states have (on average 1.2529154518950438) internal successors, (1719), 1456 states have internal predecessors, (1719), 556 states have call successors, (556), 108 states have call predecessors, (556), 107 states have return successors, (554), 517 states have call predecessors, (554), 554 states have call successors, (554) [2022-07-12 16:56:46,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2829 transitions. [2022-07-12 16:56:46,579 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2829 transitions. Word has length 116 [2022-07-12 16:56:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:46,580 INFO L495 AbstractCegarLoop]: Abstraction has 2058 states and 2829 transitions. [2022-07-12 16:56:46,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.823529411764706) internal successors, (65), 17 states have internal predecessors, (65), 7 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-07-12 16:56:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2829 transitions. [2022-07-12 16:56:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 16:56:46,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:46,582 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:46,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 16:56:46,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:56:46,808 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:56:46,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:46,808 INFO L85 PathProgramCache]: Analyzing trace with hash 925689958, now seen corresponding path program 1 times [2022-07-12 16:56:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:46,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137421651] [2022-07-12 16:56:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:46,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:56:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:56:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:56:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:56:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:56:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:56:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:56:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:56:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:56:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 16:56:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 16:56:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 16:56:47,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:47,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137421651] [2022-07-12 16:56:47,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137421651] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:56:47,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658736671] [2022-07-12 16:56:47,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:47,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:56:47,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:56:47,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:56:47,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 16:56:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 3967 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 16:56:48,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:56:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 16:56:48,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 16:56:48,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658736671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:48,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 16:56:48,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 9 [2022-07-12 16:56:48,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097208753] [2022-07-12 16:56:48,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:48,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:48,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:48,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:48,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 16:56:48,441 INFO L87 Difference]: Start difference. First operand 2058 states and 2829 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 16:56:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:49,282 INFO L93 Difference]: Finished difference Result 4013 states and 5523 transitions. [2022-07-12 16:56:49,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:49,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 116 [2022-07-12 16:56:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:49,295 INFO L225 Difference]: With dead ends: 4013 [2022-07-12 16:56:49,296 INFO L226 Difference]: Without dead ends: 2080 [2022-07-12 16:56:49,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:56:49,308 INFO L413 NwaCegarLoop]: 2848 mSDtfsCounter, 1288 mSDsluCounter, 9436 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 12284 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:49,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 12284 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 16:56:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2022-07-12 16:56:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2056. [2022-07-12 16:56:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 1371 states have (on average 1.2523705324580598) internal successors, (1717), 1455 states have internal predecessors, (1717), 555 states have call successors, (555), 108 states have call predecessors, (555), 107 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:56:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2825 transitions. [2022-07-12 16:56:49,428 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2825 transitions. Word has length 116 [2022-07-12 16:56:49,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:49,429 INFO L495 AbstractCegarLoop]: Abstraction has 2056 states and 2825 transitions. [2022-07-12 16:56:49,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 16:56:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2825 transitions. [2022-07-12 16:56:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 16:56:49,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:49,432 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:49,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 16:56:49,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-07-12 16:56:49,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:56:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:49,655 INFO L85 PathProgramCache]: Analyzing trace with hash -97827155, now seen corresponding path program 1 times [2022-07-12 16:56:49,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:49,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491178045] [2022-07-12 16:56:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:49,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:49,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:49,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:49,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:56:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:49,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:56:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:49,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:56:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:56:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:49,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:49,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:56:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:49,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:50,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:50,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:50,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:56:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:50,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:50,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491178045] [2022-07-12 16:56:50,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491178045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:50,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:50,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:50,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587011146] [2022-07-12 16:56:50,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:50,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:50,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:50,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:50,040 INFO L87 Difference]: Start difference. First operand 2056 states and 2825 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:56:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:54,274 INFO L93 Difference]: Finished difference Result 2056 states and 2825 transitions. [2022-07-12 16:56:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:54,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2022-07-12 16:56:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:54,284 INFO L225 Difference]: With dead ends: 2056 [2022-07-12 16:56:54,284 INFO L226 Difference]: Without dead ends: 2054 [2022-07-12 16:56:54,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:54,286 INFO L413 NwaCegarLoop]: 2568 mSDtfsCounter, 4098 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2703 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4400 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 4725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:54,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4400 Valid, 4839 Invalid, 4725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2703 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 16:56:54,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2022-07-12 16:56:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2022-07-12 16:56:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 1370 states have (on average 1.2518248175182483) internal successors, (1715), 1453 states have internal predecessors, (1715), 555 states have call successors, (555), 108 states have call predecessors, (555), 107 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:56:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2823 transitions. [2022-07-12 16:56:54,385 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2823 transitions. Word has length 107 [2022-07-12 16:56:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:54,386 INFO L495 AbstractCegarLoop]: Abstraction has 2054 states and 2823 transitions. [2022-07-12 16:56:54,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:56:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2823 transitions. [2022-07-12 16:56:54,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 16:56:54,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:54,388 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:54,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 16:56:54,388 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:56:54,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2138249491, now seen corresponding path program 1 times [2022-07-12 16:56:54,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:54,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631614939] [2022-07-12 16:56:54,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:54,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:56:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:56:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:56:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:56:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:56:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:56:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:56:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:54,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:54,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631614939] [2022-07-12 16:56:54,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631614939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:54,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:54,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:54,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351077564] [2022-07-12 16:56:54,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:54,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:54,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:54,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:54,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:54,744 INFO L87 Difference]: Start difference. First operand 2054 states and 2823 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:56:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:58,801 INFO L93 Difference]: Finished difference Result 2054 states and 2823 transitions. [2022-07-12 16:56:58,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:58,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2022-07-12 16:56:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:58,812 INFO L225 Difference]: With dead ends: 2054 [2022-07-12 16:56:58,812 INFO L226 Difference]: Without dead ends: 2052 [2022-07-12 16:56:58,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:58,814 INFO L413 NwaCegarLoop]: 2566 mSDtfsCounter, 4096 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4397 SdHoareTripleChecker+Valid, 4837 SdHoareTripleChecker+Invalid, 4719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:58,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4397 Valid, 4837 Invalid, 4719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 16:56:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2022-07-12 16:56:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 2052. [2022-07-12 16:56:58,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 1369 states have (on average 1.2512783053323593) internal successors, (1713), 1451 states have internal predecessors, (1713), 555 states have call successors, (555), 108 states have call predecessors, (555), 107 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:56:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2821 transitions. [2022-07-12 16:56:58,915 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2821 transitions. Word has length 113 [2022-07-12 16:56:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:58,915 INFO L495 AbstractCegarLoop]: Abstraction has 2052 states and 2821 transitions. [2022-07-12 16:56:58,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:56:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2821 transitions. [2022-07-12 16:56:58,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 16:56:58,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:58,917 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:56:58,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 16:56:58,917 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:56:58,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:58,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1863528822, now seen corresponding path program 1 times [2022-07-12 16:56:58,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:58,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023238122] [2022-07-12 16:56:58,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:58,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:56:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:56:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:56:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:56:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:56:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:56:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:56:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:56:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:56:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:56:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:56:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:56:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:56:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:56:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:56:59,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:59,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023238122] [2022-07-12 16:56:59,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023238122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:59,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:59,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:59,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862104321] [2022-07-12 16:56:59,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:59,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:59,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:59,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:59,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:59,264 INFO L87 Difference]: Start difference. First operand 2052 states and 2821 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:57:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:03,170 INFO L93 Difference]: Finished difference Result 2052 states and 2821 transitions. [2022-07-12 16:57:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:03,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2022-07-12 16:57:03,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:03,180 INFO L225 Difference]: With dead ends: 2052 [2022-07-12 16:57:03,180 INFO L226 Difference]: Without dead ends: 2050 [2022-07-12 16:57:03,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:03,182 INFO L413 NwaCegarLoop]: 2564 mSDtfsCounter, 4084 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4385 SdHoareTripleChecker+Valid, 4835 SdHoareTripleChecker+Invalid, 4721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:03,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4385 Valid, 4835 Invalid, 4721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2699 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-12 16:57:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2022-07-12 16:57:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2022-07-12 16:57:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1368 states have (on average 1.2507309941520468) internal successors, (1711), 1449 states have internal predecessors, (1711), 555 states have call successors, (555), 108 states have call predecessors, (555), 107 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:57:03,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2819 transitions. [2022-07-12 16:57:03,284 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2819 transitions. Word has length 115 [2022-07-12 16:57:03,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:03,285 INFO L495 AbstractCegarLoop]: Abstraction has 2050 states and 2819 transitions. [2022-07-12 16:57:03,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:57:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2819 transitions. [2022-07-12 16:57:03,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 16:57:03,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:03,287 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:03,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 16:57:03,287 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:57:03,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash 656543310, now seen corresponding path program 1 times [2022-07-12 16:57:03,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:03,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733181965] [2022-07-12 16:57:03,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:03,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:57:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:57:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:57:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:57:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:57:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:57:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:57:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:57:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:57:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:57:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:57:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:57:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:57:03,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:03,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733181965] [2022-07-12 16:57:03,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733181965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:03,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:03,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:03,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932986319] [2022-07-12 16:57:03,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:03,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:03,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:03,626 INFO L87 Difference]: Start difference. First operand 2050 states and 2819 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 16:57:07,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:07,674 INFO L93 Difference]: Finished difference Result 2050 states and 2819 transitions. [2022-07-12 16:57:07,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:07,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2022-07-12 16:57:07,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:07,683 INFO L225 Difference]: With dead ends: 2050 [2022-07-12 16:57:07,683 INFO L226 Difference]: Without dead ends: 2048 [2022-07-12 16:57:07,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:07,685 INFO L413 NwaCegarLoop]: 2562 mSDtfsCounter, 4080 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4380 SdHoareTripleChecker+Valid, 4833 SdHoareTripleChecker+Invalid, 4719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:07,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4380 Valid, 4833 Invalid, 4719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 16:57:07,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2022-07-12 16:57:07,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2022-07-12 16:57:07,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1367 states have (on average 1.2501828822238479) internal successors, (1709), 1447 states have internal predecessors, (1709), 555 states have call successors, (555), 108 states have call predecessors, (555), 107 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:57:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2817 transitions. [2022-07-12 16:57:07,791 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2817 transitions. Word has length 121 [2022-07-12 16:57:07,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:07,791 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2817 transitions. [2022-07-12 16:57:07,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 16:57:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2817 transitions. [2022-07-12 16:57:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 16:57:07,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:07,793 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:07,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 16:57:07,794 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:57:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:07,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1147805020, now seen corresponding path program 1 times [2022-07-12 16:57:07,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:07,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886305722] [2022-07-12 16:57:07,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:07,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:57:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 16:57:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 16:57:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 16:57:08,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:08,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:57:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:57:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:57:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:57:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 16:57:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 16:57:08,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:08,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886305722] [2022-07-12 16:57:08,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886305722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:08,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:08,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 16:57:08,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756572076] [2022-07-12 16:57:08,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:08,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 16:57:08,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:08,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 16:57:08,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 16:57:08,271 INFO L87 Difference]: Start difference. First operand 2048 states and 2817 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:57:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:15,545 INFO L93 Difference]: Finished difference Result 4256 states and 5931 transitions. [2022-07-12 16:57:15,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:15,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2022-07-12 16:57:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:15,561 INFO L225 Difference]: With dead ends: 4256 [2022-07-12 16:57:15,561 INFO L226 Difference]: Without dead ends: 2267 [2022-07-12 16:57:15,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:57:15,571 INFO L413 NwaCegarLoop]: 2154 mSDtfsCounter, 5141 mSDsluCounter, 2567 mSDsCounter, 0 mSdLazyCounter, 3627 mSolverCounterSat, 3319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5483 SdHoareTripleChecker+Valid, 4721 SdHoareTripleChecker+Invalid, 6946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3319 IncrementalHoareTripleChecker+Valid, 3627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:15,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5483 Valid, 4721 Invalid, 6946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3319 Valid, 3627 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-12 16:57:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-07-12 16:57:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2044. [2022-07-12 16:57:15,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1364 states have (on average 1.249266862170088) internal successors, (1704), 1443 states have internal predecessors, (1704), 555 states have call successors, (555), 108 states have call predecessors, (555), 107 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:57:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2812 transitions. [2022-07-12 16:57:15,709 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2812 transitions. Word has length 163 [2022-07-12 16:57:15,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:15,710 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2812 transitions. [2022-07-12 16:57:15,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:57:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2812 transitions. [2022-07-12 16:57:15,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 16:57:15,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:15,713 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:15,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 16:57:15,713 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:57:15,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:15,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1112029439, now seen corresponding path program 1 times [2022-07-12 16:57:15,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:15,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608839040] [2022-07-12 16:57:15,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:15,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:15,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:15,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:15,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:15,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:57:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:57:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:57:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:15,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:57:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:57:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:57:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:57:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:57:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:57:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:57:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:57:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:57:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:57:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:57:16,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:16,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608839040] [2022-07-12 16:57:16,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608839040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:16,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:16,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:16,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599695501] [2022-07-12 16:57:16,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:16,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:16,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:16,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:16,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:16,078 INFO L87 Difference]: Start difference. First operand 2044 states and 2812 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 16:57:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:20,321 INFO L93 Difference]: Finished difference Result 2044 states and 2812 transitions. [2022-07-12 16:57:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:20,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-07-12 16:57:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:20,332 INFO L225 Difference]: With dead ends: 2044 [2022-07-12 16:57:20,332 INFO L226 Difference]: Without dead ends: 2042 [2022-07-12 16:57:20,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:20,334 INFO L413 NwaCegarLoop]: 2555 mSDtfsCounter, 4069 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 2694 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4368 SdHoareTripleChecker+Valid, 4812 SdHoareTripleChecker+Invalid, 4716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:20,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4368 Valid, 4812 Invalid, 4716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2694 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 16:57:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2022-07-12 16:57:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2022-07-12 16:57:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1363 states have (on average 1.2487160674981659) internal successors, (1702), 1441 states have internal predecessors, (1702), 555 states have call successors, (555), 108 states have call predecessors, (555), 107 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:57:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2810 transitions. [2022-07-12 16:57:20,460 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2810 transitions. Word has length 127 [2022-07-12 16:57:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:20,461 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 2810 transitions. [2022-07-12 16:57:20,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 16:57:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2810 transitions. [2022-07-12 16:57:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 16:57:20,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:20,463 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2022-07-12 16:57:20,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 16:57:20,464 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:57:20,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:20,464 INFO L85 PathProgramCache]: Analyzing trace with hash 624354067, now seen corresponding path program 1 times [2022-07-12 16:57:20,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:20,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256365278] [2022-07-12 16:57:20,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:20,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:57:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 16:57:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 16:57:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 16:57:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:57:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:57:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:57:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:57:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 16:57:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 16:57:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-07-12 16:57:20,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:20,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256365278] [2022-07-12 16:57:20,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256365278] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:57:20,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157385134] [2022-07-12 16:57:20,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:20,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:20,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:57:20,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:57:20,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 16:57:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:22,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 4362 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 16:57:22,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:57:22,373 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 16:57:22,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 16:57:22,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157385134] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:22,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 16:57:22,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-12 16:57:22,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345551348] [2022-07-12 16:57:22,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:22,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 16:57:22,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:22,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 16:57:22,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:57:22,375 INFO L87 Difference]: Start difference. First operand 2042 states and 2810 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:57:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:22,539 INFO L93 Difference]: Finished difference Result 4029 states and 5537 transitions. [2022-07-12 16:57:22,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 16:57:22,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 169 [2022-07-12 16:57:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:22,555 INFO L225 Difference]: With dead ends: 4029 [2022-07-12 16:57:22,556 INFO L226 Difference]: Without dead ends: 2049 [2022-07-12 16:57:22,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:57:22,567 INFO L413 NwaCegarLoop]: 2797 mSDtfsCounter, 2754 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2754 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:22,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2754 Valid, 2819 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 16:57:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2022-07-12 16:57:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2048. [2022-07-12 16:57:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1367 states have (on average 1.246525237746891) internal successors, (1704), 1444 states have internal predecessors, (1704), 555 states have call successors, (555), 111 states have call predecessors, (555), 110 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:57:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2812 transitions. [2022-07-12 16:57:22,690 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2812 transitions. Word has length 169 [2022-07-12 16:57:22,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:22,690 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2812 transitions. [2022-07-12 16:57:22,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:57:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2812 transitions. [2022-07-12 16:57:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 16:57:22,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:22,694 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:22,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 16:57:22,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:57:22,908 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:57:22,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:22,908 INFO L85 PathProgramCache]: Analyzing trace with hash -341229517, now seen corresponding path program 1 times [2022-07-12 16:57:22,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:22,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588145067] [2022-07-12 16:57:22,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:22,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:57:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 16:57:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 16:57:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 16:57:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:57:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:23,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:57:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:57:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:57:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 16:57:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 16:57:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 16:57:23,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:23,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588145067] [2022-07-12 16:57:23,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588145067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:23,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:23,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 16:57:23,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208248821] [2022-07-12 16:57:23,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:23,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 16:57:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:23,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 16:57:23,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 16:57:23,288 INFO L87 Difference]: Start difference. First operand 2048 states and 2812 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 16:57:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:30,572 INFO L93 Difference]: Finished difference Result 2171 states and 3031 transitions. [2022-07-12 16:57:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:57:30,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 175 [2022-07-12 16:57:30,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:30,581 INFO L225 Difference]: With dead ends: 2171 [2022-07-12 16:57:30,581 INFO L226 Difference]: Without dead ends: 2169 [2022-07-12 16:57:30,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-07-12 16:57:30,583 INFO L413 NwaCegarLoop]: 2543 mSDtfsCounter, 2909 mSDsluCounter, 3847 mSDsCounter, 0 mSdLazyCounter, 5629 mSolverCounterSat, 2422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 6390 SdHoareTripleChecker+Invalid, 8051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2422 IncrementalHoareTripleChecker+Valid, 5629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:30,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 6390 Invalid, 8051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2422 Valid, 5629 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-12 16:57:30,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2022-07-12 16:57:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2050. [2022-07-12 16:57:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1369 states have (on average 1.246165084002922) internal successors, (1706), 1446 states have internal predecessors, (1706), 555 states have call successors, (555), 111 states have call predecessors, (555), 110 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:57:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2814 transitions. [2022-07-12 16:57:30,706 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2814 transitions. Word has length 175 [2022-07-12 16:57:30,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:30,709 INFO L495 AbstractCegarLoop]: Abstraction has 2050 states and 2814 transitions. [2022-07-12 16:57:30,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2022-07-12 16:57:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2814 transitions. [2022-07-12 16:57:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 16:57:30,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:30,711 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:30,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 16:57:30,712 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:57:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:30,712 INFO L85 PathProgramCache]: Analyzing trace with hash -341289099, now seen corresponding path program 1 times [2022-07-12 16:57:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:30,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760052136] [2022-07-12 16:57:30,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:57:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 16:57:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 16:57:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 16:57:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:57:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:57:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:57:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:57:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 16:57:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 16:57:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 16:57:31,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:31,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760052136] [2022-07-12 16:57:31,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760052136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:31,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:31,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 16:57:31,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103287969] [2022-07-12 16:57:31,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:31,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 16:57:31,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:31,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 16:57:31,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 16:57:31,157 INFO L87 Difference]: Start difference. First operand 2050 states and 2814 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:57:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:39,549 INFO L93 Difference]: Finished difference Result 4154 states and 5788 transitions. [2022-07-12 16:57:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 16:57:39,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 175 [2022-07-12 16:57:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:39,559 INFO L225 Difference]: With dead ends: 4154 [2022-07-12 16:57:39,560 INFO L226 Difference]: Without dead ends: 2170 [2022-07-12 16:57:39,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-12 16:57:39,567 INFO L413 NwaCegarLoop]: 2549 mSDtfsCounter, 2897 mSDsluCounter, 3847 mSDsCounter, 0 mSdLazyCounter, 5666 mSolverCounterSat, 2410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2897 SdHoareTripleChecker+Valid, 6396 SdHoareTripleChecker+Invalid, 8076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2410 IncrementalHoareTripleChecker+Valid, 5666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:39,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2897 Valid, 6396 Invalid, 8076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2410 Valid, 5666 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-07-12 16:57:39,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2022-07-12 16:57:39,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2052. [2022-07-12 16:57:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 1371 states have (on average 1.2458059810357403) internal successors, (1708), 1448 states have internal predecessors, (1708), 555 states have call successors, (555), 111 states have call predecessors, (555), 110 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:57:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2816 transitions. [2022-07-12 16:57:39,693 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2816 transitions. Word has length 175 [2022-07-12 16:57:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:39,693 INFO L495 AbstractCegarLoop]: Abstraction has 2052 states and 2816 transitions. [2022-07-12 16:57:39,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:57:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2816 transitions. [2022-07-12 16:57:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 16:57:39,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:39,695 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:39,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 16:57:39,696 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:57:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash -989632069, now seen corresponding path program 1 times [2022-07-12 16:57:39,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:39,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238568092] [2022-07-12 16:57:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:57:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:57:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:57:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:57:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:57:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:57:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:57:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:57:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:57:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:57:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:57:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:57:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:57:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:57:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:57:40,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:40,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238568092] [2022-07-12 16:57:40,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238568092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:40,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:40,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:40,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617684374] [2022-07-12 16:57:40,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:40,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:40,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:40,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:40,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:40,128 INFO L87 Difference]: Start difference. First operand 2052 states and 2816 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 16:57:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:44,276 INFO L93 Difference]: Finished difference Result 2052 states and 2816 transitions. [2022-07-12 16:57:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:44,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2022-07-12 16:57:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:44,287 INFO L225 Difference]: With dead ends: 2052 [2022-07-12 16:57:44,287 INFO L226 Difference]: Without dead ends: 2050 [2022-07-12 16:57:44,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:44,289 INFO L413 NwaCegarLoop]: 2548 mSDtfsCounter, 4058 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2691 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4356 SdHoareTripleChecker+Valid, 4791 SdHoareTripleChecker+Invalid, 4713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:44,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4356 Valid, 4791 Invalid, 4713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2691 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 16:57:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2022-07-12 16:57:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2022-07-12 16:57:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 1370 states have (on average 1.2452554744525548) internal successors, (1706), 1446 states have internal predecessors, (1706), 555 states have call successors, (555), 111 states have call predecessors, (555), 110 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:57:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2814 transitions. [2022-07-12 16:57:44,473 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2814 transitions. Word has length 133 [2022-07-12 16:57:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:44,474 INFO L495 AbstractCegarLoop]: Abstraction has 2050 states and 2814 transitions. [2022-07-12 16:57:44,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 16:57:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2814 transitions. [2022-07-12 16:57:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-12 16:57:44,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:44,475 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:44,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 16:57:44,476 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:57:44,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1489195741, now seen corresponding path program 1 times [2022-07-12 16:57:44,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:44,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187513803] [2022-07-12 16:57:44,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:44,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:57:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:57:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:57:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:57:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:57:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:57:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:57:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:57:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:57:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:57:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:57:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:57:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:57:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:57:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:57:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:57:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:57:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:57:44,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:44,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187513803] [2022-07-12 16:57:44,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187513803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:44,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:44,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:44,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716194477] [2022-07-12 16:57:44,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:44,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:44,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:44,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:44,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:44,852 INFO L87 Difference]: Start difference. First operand 2050 states and 2814 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 16:57:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:49,127 INFO L93 Difference]: Finished difference Result 2050 states and 2814 transitions. [2022-07-12 16:57:49,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:49,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2022-07-12 16:57:49,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:49,134 INFO L225 Difference]: With dead ends: 2050 [2022-07-12 16:57:49,134 INFO L226 Difference]: Without dead ends: 2048 [2022-07-12 16:57:49,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:49,135 INFO L413 NwaCegarLoop]: 2546 mSDtfsCounter, 4052 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4349 SdHoareTripleChecker+Valid, 4789 SdHoareTripleChecker+Invalid, 4711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:49,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4349 Valid, 4789 Invalid, 4711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-12 16:57:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2022-07-12 16:57:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2022-07-12 16:57:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2048 states, 1369 states have (on average 1.2447041636230824) internal successors, (1704), 1444 states have internal predecessors, (1704), 555 states have call successors, (555), 111 states have call predecessors, (555), 110 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:57:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2812 transitions. [2022-07-12 16:57:49,314 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2812 transitions. Word has length 139 [2022-07-12 16:57:49,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:49,314 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2812 transitions. [2022-07-12 16:57:49,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 16:57:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2812 transitions. [2022-07-12 16:57:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-12 16:57:49,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:49,316 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:49,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 16:57:49,316 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:57:49,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1813546498, now seen corresponding path program 1 times [2022-07-12 16:57:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:49,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195398301] [2022-07-12 16:57:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:57:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:57:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 16:57:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 16:57:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 16:57:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:57:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:57:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:57:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:57:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 16:57:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 16:57:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 16:57:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 16:57:49,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:49,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195398301] [2022-07-12 16:57:49,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195398301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:49,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:49,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 16:57:49,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676484366] [2022-07-12 16:57:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:49,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 16:57:49,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:49,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 16:57:49,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 16:57:49,813 INFO L87 Difference]: Start difference. First operand 2048 states and 2812 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:57:59,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:59,736 INFO L93 Difference]: Finished difference Result 4142 states and 5839 transitions. [2022-07-12 16:57:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 16:57:59,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 182 [2022-07-12 16:57:59,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:59,750 INFO L225 Difference]: With dead ends: 4142 [2022-07-12 16:57:59,750 INFO L226 Difference]: Without dead ends: 2160 [2022-07-12 16:57:59,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-07-12 16:57:59,758 INFO L413 NwaCegarLoop]: 2539 mSDtfsCounter, 4909 mSDsluCounter, 4489 mSDsCounter, 0 mSdLazyCounter, 7813 mSolverCounterSat, 2959 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5238 SdHoareTripleChecker+Valid, 7028 SdHoareTripleChecker+Invalid, 10772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2959 IncrementalHoareTripleChecker+Valid, 7813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:59,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5238 Valid, 7028 Invalid, 10772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2959 Valid, 7813 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-07-12 16:57:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2022-07-12 16:57:59,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2044. [2022-07-12 16:57:59,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2044 states, 1366 states have (on average 1.2437774524158125) internal successors, (1699), 1440 states have internal predecessors, (1699), 555 states have call successors, (555), 111 states have call predecessors, (555), 110 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:57:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2807 transitions. [2022-07-12 16:57:59,888 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2807 transitions. Word has length 182 [2022-07-12 16:57:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:59,889 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2807 transitions. [2022-07-12 16:57:59,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (21), 5 states have call predecessors, (21), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:57:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2807 transitions. [2022-07-12 16:57:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-12 16:57:59,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:59,891 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:57:59,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 16:57:59,891 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:57:59,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1191704634, now seen corresponding path program 1 times [2022-07-12 16:57:59,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:59,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123332259] [2022-07-12 16:57:59,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:59,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:58:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:58:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:58:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:58:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:58:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:58:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:58:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:58:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:58:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:58:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:00,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:00,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123332259] [2022-07-12 16:58:00,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123332259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:00,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:00,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:00,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92225466] [2022-07-12 16:58:00,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:00,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:00,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:00,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:00,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:00,216 INFO L87 Difference]: Start difference. First operand 2044 states and 2807 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 16:58:04,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:04,283 INFO L93 Difference]: Finished difference Result 2044 states and 2807 transitions. [2022-07-12 16:58:04,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:04,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2022-07-12 16:58:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:04,292 INFO L225 Difference]: With dead ends: 2044 [2022-07-12 16:58:04,292 INFO L226 Difference]: Without dead ends: 2042 [2022-07-12 16:58:04,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:04,294 INFO L413 NwaCegarLoop]: 2541 mSDtfsCounter, 4037 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4333 SdHoareTripleChecker+Valid, 4784 SdHoareTripleChecker+Invalid, 4706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:04,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4333 Valid, 4784 Invalid, 4706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2684 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 16:58:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2022-07-12 16:58:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2022-07-12 16:58:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2042 states, 1365 states have (on average 1.2432234432234432) internal successors, (1697), 1438 states have internal predecessors, (1697), 555 states have call successors, (555), 111 states have call predecessors, (555), 110 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:58:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2805 transitions. [2022-07-12 16:58:04,435 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2805 transitions. Word has length 145 [2022-07-12 16:58:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:04,436 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 2805 transitions. [2022-07-12 16:58:04,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 16:58:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2805 transitions. [2022-07-12 16:58:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-12 16:58:04,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:04,437 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:04,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 16:58:04,438 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:58:04,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:04,438 INFO L85 PathProgramCache]: Analyzing trace with hash -382114972, now seen corresponding path program 1 times [2022-07-12 16:58:04,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:04,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461346113] [2022-07-12 16:58:04,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:04,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 16:58:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 16:58:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 16:58:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:58:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:58:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:58:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:58:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 16:58:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 16:58:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:04,821 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-12 16:58:04,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:04,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461346113] [2022-07-12 16:58:04,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461346113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:04,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:04,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:04,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033857773] [2022-07-12 16:58:04,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:04,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:04,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:04,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:04,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:04,823 INFO L87 Difference]: Start difference. First operand 2042 states and 2805 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 16:58:09,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:09,167 INFO L93 Difference]: Finished difference Result 4130 states and 5825 transitions. [2022-07-12 16:58:09,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:09,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 189 [2022-07-12 16:58:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:09,182 INFO L225 Difference]: With dead ends: 4130 [2022-07-12 16:58:09,183 INFO L226 Difference]: Without dead ends: 2154 [2022-07-12 16:58:09,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:09,196 INFO L413 NwaCegarLoop]: 2531 mSDtfsCounter, 4880 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 1915 mSolverCounterSat, 2957 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5212 SdHoareTripleChecker+Valid, 4454 SdHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2957 IncrementalHoareTripleChecker+Valid, 1915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:09,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5212 Valid, 4454 Invalid, 4872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2957 Valid, 1915 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 16:58:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-07-12 16:58:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2038. [2022-07-12 16:58:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2038 states, 1362 states have (on average 1.2422907488986785) internal successors, (1692), 1434 states have internal predecessors, (1692), 555 states have call successors, (555), 111 states have call predecessors, (555), 110 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:58:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2800 transitions. [2022-07-12 16:58:09,345 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2800 transitions. Word has length 189 [2022-07-12 16:58:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:09,346 INFO L495 AbstractCegarLoop]: Abstraction has 2038 states and 2800 transitions. [2022-07-12 16:58:09,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (22), 5 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 16:58:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2800 transitions. [2022-07-12 16:58:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-12 16:58:09,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:09,348 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:09,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 16:58:09,348 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:58:09,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:09,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1667725455, now seen corresponding path program 1 times [2022-07-12 16:58:09,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:09,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133545046] [2022-07-12 16:58:09,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:09,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:09,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:58:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:58:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:58:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:58:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:58:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:58:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:58:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:58:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:58:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:58:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:58:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:09,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:09,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133545046] [2022-07-12 16:58:09,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133545046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:09,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:09,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:09,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932306294] [2022-07-12 16:58:09,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:09,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:09,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:09,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:09,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:09,718 INFO L87 Difference]: Start difference. First operand 2038 states and 2800 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 16:58:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:14,144 INFO L93 Difference]: Finished difference Result 2038 states and 2800 transitions. [2022-07-12 16:58:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:14,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2022-07-12 16:58:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:14,151 INFO L225 Difference]: With dead ends: 2038 [2022-07-12 16:58:14,151 INFO L226 Difference]: Without dead ends: 2036 [2022-07-12 16:58:14,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:14,153 INFO L413 NwaCegarLoop]: 2534 mSDtfsCounter, 4016 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2677 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4311 SdHoareTripleChecker+Valid, 4777 SdHoareTripleChecker+Invalid, 4699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:14,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4311 Valid, 4777 Invalid, 4699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2677 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 16:58:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2022-07-12 16:58:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 2036. [2022-07-12 16:58:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2036 states, 1361 states have (on average 1.2417340191036004) internal successors, (1690), 1432 states have internal predecessors, (1690), 555 states have call successors, (555), 111 states have call predecessors, (555), 110 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:58:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 2798 transitions. [2022-07-12 16:58:14,308 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 2798 transitions. Word has length 151 [2022-07-12 16:58:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:14,309 INFO L495 AbstractCegarLoop]: Abstraction has 2036 states and 2798 transitions. [2022-07-12 16:58:14,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 16:58:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2798 transitions. [2022-07-12 16:58:14,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 16:58:14,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:14,311 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:14,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 16:58:14,311 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:58:14,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:14,311 INFO L85 PathProgramCache]: Analyzing trace with hash 926045391, now seen corresponding path program 1 times [2022-07-12 16:58:14,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:14,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367981240] [2022-07-12 16:58:14,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:14,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:58:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:58:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:58:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:58:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:58:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:58:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:58:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:58:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:58:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:58:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:58:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:58:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:14,714 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:14,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:14,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367981240] [2022-07-12 16:58:14,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367981240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:14,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:14,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:14,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70771237] [2022-07-12 16:58:14,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:14,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:14,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:14,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:14,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:14,717 INFO L87 Difference]: Start difference. First operand 2036 states and 2798 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 16:58:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:18,913 INFO L93 Difference]: Finished difference Result 2036 states and 2798 transitions. [2022-07-12 16:58:18,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:18,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2022-07-12 16:58:18,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:18,922 INFO L225 Difference]: With dead ends: 2036 [2022-07-12 16:58:18,922 INFO L226 Difference]: Without dead ends: 2034 [2022-07-12 16:58:18,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:18,924 INFO L413 NwaCegarLoop]: 2532 mSDtfsCounter, 4010 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2675 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4304 SdHoareTripleChecker+Valid, 4775 SdHoareTripleChecker+Invalid, 4697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:18,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4304 Valid, 4775 Invalid, 4697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2675 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 16:58:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2022-07-12 16:58:19,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2034. [2022-07-12 16:58:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2034 states, 1360 states have (on average 1.2411764705882353) internal successors, (1688), 1430 states have internal predecessors, (1688), 555 states have call successors, (555), 111 states have call predecessors, (555), 110 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:58:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2796 transitions. [2022-07-12 16:58:19,086 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2796 transitions. Word has length 157 [2022-07-12 16:58:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:19,086 INFO L495 AbstractCegarLoop]: Abstraction has 2034 states and 2796 transitions. [2022-07-12 16:58:19,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 16:58:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2796 transitions. [2022-07-12 16:58:19,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 16:58:19,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:19,088 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:19,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 16:58:19,089 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:58:19,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:19,089 INFO L85 PathProgramCache]: Analyzing trace with hash 603295667, now seen corresponding path program 1 times [2022-07-12 16:58:19,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:19,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769820872] [2022-07-12 16:58:19,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:19,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:58:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:58:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:58:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:58:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:58:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:58:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:58:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:58:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:58:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:58:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:58:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:58:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:58:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:19,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:19,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769820872] [2022-07-12 16:58:19,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769820872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:19,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:19,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472312357] [2022-07-12 16:58:19,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:19,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:19,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:19,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:19,470 INFO L87 Difference]: Start difference. First operand 2034 states and 2796 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 16:58:23,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:23,881 INFO L93 Difference]: Finished difference Result 2034 states and 2796 transitions. [2022-07-12 16:58:23,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:23,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2022-07-12 16:58:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:23,888 INFO L225 Difference]: With dead ends: 2034 [2022-07-12 16:58:23,888 INFO L226 Difference]: Without dead ends: 2032 [2022-07-12 16:58:23,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:23,890 INFO L413 NwaCegarLoop]: 2530 mSDtfsCounter, 4004 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2673 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4297 SdHoareTripleChecker+Valid, 4773 SdHoareTripleChecker+Invalid, 4695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:23,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4297 Valid, 4773 Invalid, 4695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2673 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-12 16:58:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2022-07-12 16:58:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 2032. [2022-07-12 16:58:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 1359 states have (on average 1.2406181015452538) internal successors, (1686), 1428 states have internal predecessors, (1686), 555 states have call successors, (555), 111 states have call predecessors, (555), 110 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:58:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2794 transitions. [2022-07-12 16:58:24,054 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2794 transitions. Word has length 163 [2022-07-12 16:58:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:24,055 INFO L495 AbstractCegarLoop]: Abstraction has 2032 states and 2794 transitions. [2022-07-12 16:58:24,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 16:58:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2794 transitions. [2022-07-12 16:58:24,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 16:58:24,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:24,057 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:24,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 16:58:24,057 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:58:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:24,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2069826128, now seen corresponding path program 1 times [2022-07-12 16:58:24,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:24,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214287925] [2022-07-12 16:58:24,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:24,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:24,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:58:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:58:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:58:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:58:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:58:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:58:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:58:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:58:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:58:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:58:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:58:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:58:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:58:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 16:58:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:24,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:24,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214287925] [2022-07-12 16:58:24,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214287925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:24,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:24,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446660210] [2022-07-12 16:58:24,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:24,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:24,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:24,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:24,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:24,428 INFO L87 Difference]: Start difference. First operand 2032 states and 2794 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 16:58:29,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:29,000 INFO L93 Difference]: Finished difference Result 2032 states and 2794 transitions. [2022-07-12 16:58:29,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:29,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2022-07-12 16:58:29,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:29,010 INFO L225 Difference]: With dead ends: 2032 [2022-07-12 16:58:29,011 INFO L226 Difference]: Without dead ends: 2030 [2022-07-12 16:58:29,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:29,013 INFO L413 NwaCegarLoop]: 2528 mSDtfsCounter, 3998 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2671 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4290 SdHoareTripleChecker+Valid, 4771 SdHoareTripleChecker+Invalid, 4693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:29,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4290 Valid, 4771 Invalid, 4693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2671 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 16:58:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2022-07-12 16:58:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2030. [2022-07-12 16:58:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 1358 states have (on average 1.240058910162003) internal successors, (1684), 1426 states have internal predecessors, (1684), 555 states have call successors, (555), 111 states have call predecessors, (555), 110 states have return successors, (553), 516 states have call predecessors, (553), 553 states have call successors, (553) [2022-07-12 16:58:29,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2792 transitions. [2022-07-12 16:58:29,242 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2792 transitions. Word has length 169 [2022-07-12 16:58:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:29,242 INFO L495 AbstractCegarLoop]: Abstraction has 2030 states and 2792 transitions. [2022-07-12 16:58:29,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 16:58:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2792 transitions. [2022-07-12 16:58:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-12 16:58:29,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:29,245 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:29,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 16:58:29,245 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:58:29,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:29,246 INFO L85 PathProgramCache]: Analyzing trace with hash 974720182, now seen corresponding path program 1 times [2022-07-12 16:58:29,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:29,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648093580] [2022-07-12 16:58:29,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:58:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:58:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:58:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:58:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:58:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:58:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:58:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:58:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:58:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:58:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:58:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:58:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:58:29,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 16:58:29,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 16:58:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:29,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:29,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648093580] [2022-07-12 16:58:29,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648093580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:29,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:29,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:29,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421670466] [2022-07-12 16:58:29,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:29,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:29,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:29,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:29,596 INFO L87 Difference]: Start difference. First operand 2030 states and 2792 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 16:58:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:39,592 INFO L93 Difference]: Finished difference Result 3994 states and 5530 transitions. [2022-07-12 16:58:39,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 16:58:39,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2022-07-12 16:58:39,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:39,611 INFO L225 Difference]: With dead ends: 3994 [2022-07-12 16:58:39,611 INFO L226 Difference]: Without dead ends: 3992 [2022-07-12 16:58:39,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 16:58:39,615 INFO L413 NwaCegarLoop]: 3100 mSDtfsCounter, 5606 mSDsluCounter, 3163 mSDsCounter, 0 mSdLazyCounter, 6135 mSolverCounterSat, 3474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5878 SdHoareTripleChecker+Valid, 6263 SdHoareTripleChecker+Invalid, 9609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3474 IncrementalHoareTripleChecker+Valid, 6135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:39,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5878 Valid, 6263 Invalid, 9609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3474 Valid, 6135 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-07-12 16:58:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3992 states. [2022-07-12 16:58:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3992 to 3967. [2022-07-12 16:58:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3967 states, 2658 states have (on average 1.2430398796087283) internal successors, (3304), 2786 states have internal predecessors, (3304), 1086 states have call successors, (1086), 217 states have call predecessors, (1086), 216 states have return successors, (1116), 1009 states have call predecessors, (1116), 1084 states have call successors, (1116) [2022-07-12 16:58:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3967 states and 5506 transitions. [2022-07-12 16:58:39,999 INFO L78 Accepts]: Start accepts. Automaton has 3967 states and 5506 transitions. Word has length 175 [2022-07-12 16:58:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:40,000 INFO L495 AbstractCegarLoop]: Abstraction has 3967 states and 5506 transitions. [2022-07-12 16:58:40,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-12 16:58:40,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3967 states and 5506 transitions. [2022-07-12 16:58:40,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-12 16:58:40,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:40,003 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:40,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 16:58:40,003 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:58:40,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2125406338, now seen corresponding path program 1 times [2022-07-12 16:58:40,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:40,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320176763] [2022-07-12 16:58:40,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:40,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:58:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:58:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:58:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:58:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:58:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:58:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:58:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:58:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:58:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:58:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:58:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:58:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:58:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 16:58:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 16:58:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:40,361 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:40,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:40,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320176763] [2022-07-12 16:58:40,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320176763] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:40,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:40,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:40,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745482723] [2022-07-12 16:58:40,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:40,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:40,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:40,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:40,363 INFO L87 Difference]: Start difference. First operand 3967 states and 5506 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 16:58:45,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:45,123 INFO L93 Difference]: Finished difference Result 3967 states and 5506 transitions. [2022-07-12 16:58:45,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:45,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2022-07-12 16:58:45,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:45,136 INFO L225 Difference]: With dead ends: 3967 [2022-07-12 16:58:45,136 INFO L226 Difference]: Without dead ends: 3965 [2022-07-12 16:58:45,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:45,138 INFO L413 NwaCegarLoop]: 2526 mSDtfsCounter, 3992 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4282 SdHoareTripleChecker+Valid, 4769 SdHoareTripleChecker+Invalid, 4691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2022 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:45,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4282 Valid, 4769 Invalid, 4691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-12 16:58:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-07-12 16:58:45,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3965. [2022-07-12 16:58:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 2657 states have (on average 1.2427549868272487) internal successors, (3302), 2784 states have internal predecessors, (3302), 1086 states have call successors, (1086), 217 states have call predecessors, (1086), 216 states have return successors, (1116), 1009 states have call predecessors, (1116), 1084 states have call successors, (1116) [2022-07-12 16:58:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 5504 transitions. [2022-07-12 16:58:45,433 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 5504 transitions. Word has length 181 [2022-07-12 16:58:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:45,434 INFO L495 AbstractCegarLoop]: Abstraction has 3965 states and 5504 transitions. [2022-07-12 16:58:45,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 16:58:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 5504 transitions. [2022-07-12 16:58:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-07-12 16:58:45,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:45,436 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-12 16:58:45,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-12 16:58:45,437 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:58:45,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:45,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1696326244, now seen corresponding path program 1 times [2022-07-12 16:58:45,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:45,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583375485] [2022-07-12 16:58:45,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 16:58:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 16:58:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 16:58:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:58:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:58:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:58:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:58:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 16:58:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 16:58:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:58:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 16:58:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:45,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 16:58:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:58:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:58:46,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 16:58:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-12 16:58:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-07-12 16:58:46,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:46,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583375485] [2022-07-12 16:58:46,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583375485] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:46,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:46,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 16:58:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747734237] [2022-07-12 16:58:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:46,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 16:58:46,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:46,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 16:58:46,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:58:46,051 INFO L87 Difference]: Start difference. First operand 3965 states and 5504 transitions. Second operand has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (30), 8 states have call predecessors, (30), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-12 16:58:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:55,358 INFO L93 Difference]: Finished difference Result 4454 states and 6317 transitions. [2022-07-12 16:58:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 16:58:55,359 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (30), 8 states have call predecessors, (30), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 231 [2022-07-12 16:58:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:55,374 INFO L225 Difference]: With dead ends: 4454 [2022-07-12 16:58:55,375 INFO L226 Difference]: Without dead ends: 4452 [2022-07-12 16:58:55,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-07-12 16:58:55,378 INFO L413 NwaCegarLoop]: 2124 mSDtfsCounter, 6743 mSDsluCounter, 4489 mSDsCounter, 0 mSdLazyCounter, 6898 mSolverCounterSat, 5044 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7030 SdHoareTripleChecker+Valid, 6613 SdHoareTripleChecker+Invalid, 11942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5044 IncrementalHoareTripleChecker+Valid, 6898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:55,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7030 Valid, 6613 Invalid, 11942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5044 Valid, 6898 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-07-12 16:58:55,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2022-07-12 16:58:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 4058. [2022-07-12 16:58:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4058 states, 2718 states have (on average 1.2391464311994114) internal successors, (3368), 2845 states have internal predecessors, (3368), 1106 states have call successors, (1106), 225 states have call predecessors, (1106), 229 states have return successors, (1162), 1032 states have call predecessors, (1162), 1104 states have call successors, (1162) [2022-07-12 16:58:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4058 states to 4058 states and 5636 transitions. [2022-07-12 16:58:55,754 INFO L78 Accepts]: Start accepts. Automaton has 4058 states and 5636 transitions. Word has length 231 [2022-07-12 16:58:55,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:55,754 INFO L495 AbstractCegarLoop]: Abstraction has 4058 states and 5636 transitions. [2022-07-12 16:58:55,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.090909090909091) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (30), 8 states have call predecessors, (30), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-12 16:58:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 4058 states and 5636 transitions. [2022-07-12 16:58:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 16:58:55,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:55,757 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:55,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-12 16:58:55,758 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:58:55,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:55,758 INFO L85 PathProgramCache]: Analyzing trace with hash 194067149, now seen corresponding path program 1 times [2022-07-12 16:58:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:55,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594412342] [2022-07-12 16:58:55,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:58:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:58:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 16:58:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-12 16:58:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 16:58:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 16:58:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 16:58:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 16:58:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 16:58:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 16:58:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 16:58:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 16:58:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 16:58:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 16:58:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:58:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-12 16:58:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-12 16:58:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 16:58:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:58:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 16:58:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 16:58:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 16:58:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 16:58:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 16:58:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 16:58:56,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:56,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594412342] [2022-07-12 16:58:56,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594412342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:56,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:56,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386913970] [2022-07-12 16:58:56,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:56,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:56,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:56,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:56,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:56,193 INFO L87 Difference]: Start difference. First operand 4058 states and 5636 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 16:59:06,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:06,178 INFO L93 Difference]: Finished difference Result 8050 states and 11371 transitions. [2022-07-12 16:59:06,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 16:59:06,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2022-07-12 16:59:06,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:06,215 INFO L225 Difference]: With dead ends: 8050 [2022-07-12 16:59:06,216 INFO L226 Difference]: Without dead ends: 7863 [2022-07-12 16:59:06,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:59:06,223 INFO L413 NwaCegarLoop]: 3724 mSDtfsCounter, 4623 mSDsluCounter, 3258 mSDsCounter, 0 mSdLazyCounter, 6771 mSolverCounterSat, 3300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4856 SdHoareTripleChecker+Valid, 6982 SdHoareTripleChecker+Invalid, 10071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3300 IncrementalHoareTripleChecker+Valid, 6771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:06,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4856 Valid, 6982 Invalid, 10071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3300 Valid, 6771 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-07-12 16:59:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7863 states. [2022-07-12 16:59:06,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7863 to 7851. [2022-07-12 16:59:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7851 states, 5269 states have (on average 1.2448282406528752) internal successors, (6559), 5514 states have internal predecessors, (6559), 2145 states have call successors, (2145), 424 states have call predecessors, (2145), 432 states have return successors, (2442), 2000 states have call predecessors, (2442), 2141 states have call successors, (2442) [2022-07-12 16:59:06,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7851 states to 7851 states and 11146 transitions. [2022-07-12 16:59:06,895 INFO L78 Accepts]: Start accepts. Automaton has 7851 states and 11146 transitions. Word has length 187 [2022-07-12 16:59:06,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:06,895 INFO L495 AbstractCegarLoop]: Abstraction has 7851 states and 11146 transitions. [2022-07-12 16:59:06,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-12 16:59:06,895 INFO L276 IsEmpty]: Start isEmpty. Operand 7851 states and 11146 transitions. [2022-07-12 16:59:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-07-12 16:59:06,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:06,898 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-12 16:59:06,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 16:59:06,898 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:59:06,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:06,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1487228132, now seen corresponding path program 1 times [2022-07-12 16:59:06,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:06,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359638499] [2022-07-12 16:59:06,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:06,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:07,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:59:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:59:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 16:59:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 16:59:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 16:59:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:59:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:59:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:59:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:59:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 16:59:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 16:59:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:59:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 16:59:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 16:59:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:59:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:59:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 16:59:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-12 16:59:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-12 16:59:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-07-12 16:59:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:07,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359638499] [2022-07-12 16:59:07,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359638499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:07,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:07,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 16:59:07,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39917847] [2022-07-12 16:59:07,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:07,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 16:59:07,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:07,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 16:59:07,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:59:07,577 INFO L87 Difference]: Start difference. First operand 7851 states and 11146 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (31), 9 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2022-07-12 16:59:20,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:20,469 INFO L93 Difference]: Finished difference Result 9171 states and 13640 transitions. [2022-07-12 16:59:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 16:59:20,470 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (31), 9 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 242 [2022-07-12 16:59:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:20,501 INFO L225 Difference]: With dead ends: 9171 [2022-07-12 16:59:20,501 INFO L226 Difference]: Without dead ends: 9169 [2022-07-12 16:59:20,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2022-07-12 16:59:20,508 INFO L413 NwaCegarLoop]: 2484 mSDtfsCounter, 5334 mSDsluCounter, 5427 mSDsCounter, 0 mSdLazyCounter, 8861 mSolverCounterSat, 5312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5334 SdHoareTripleChecker+Valid, 7911 SdHoareTripleChecker+Invalid, 14173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5312 IncrementalHoareTripleChecker+Valid, 8861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:20,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5334 Valid, 7911 Invalid, 14173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5312 Valid, 8861 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-07-12 16:59:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9169 states. [2022-07-12 16:59:21,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9169 to 7952. [2022-07-12 16:59:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7952 states, 5338 states have (on average 1.2433495691270138) internal successors, (6637), 5585 states have internal predecessors, (6637), 2161 states have call successors, (2161), 424 states have call predecessors, (2161), 449 states have return successors, (2551), 2029 states have call predecessors, (2551), 2157 states have call successors, (2551) [2022-07-12 16:59:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7952 states to 7952 states and 11349 transitions. [2022-07-12 16:59:21,190 INFO L78 Accepts]: Start accepts. Automaton has 7952 states and 11349 transitions. Word has length 242 [2022-07-12 16:59:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:21,191 INFO L495 AbstractCegarLoop]: Abstraction has 7952 states and 11349 transitions. [2022-07-12 16:59:21,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (31), 9 states have call predecessors, (31), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2022-07-12 16:59:21,191 INFO L276 IsEmpty]: Start isEmpty. Operand 7952 states and 11349 transitions. [2022-07-12 16:59:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-12 16:59:21,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:21,194 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-12 16:59:21,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-12 16:59:21,194 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:59:21,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:21,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1244439895, now seen corresponding path program 1 times [2022-07-12 16:59:21,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:21,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016832605] [2022-07-12 16:59:21,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:21,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:59:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:59:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 16:59:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 16:59:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 16:59:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:59:22,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:59:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:59:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 16:59:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 16:59:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 16:59:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 16:59:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 16:59:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 16:59:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 16:59:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 16:59:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 16:59:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 16:59:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-12 16:59:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-12 16:59:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-12 16:59:22,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,377 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2022-07-12 16:59:22,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:22,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016832605] [2022-07-12 16:59:22,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016832605] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:59:22,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843021212] [2022-07-12 16:59:22,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:22,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:59:22,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:59:22,384 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:59:22,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 16:59:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:24,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 4770 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 16:59:24,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:59:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2022-07-12 16:59:24,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 16:59:24,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843021212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:24,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 16:59:24,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26 [2022-07-12 16:59:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683075014] [2022-07-12 16:59:24,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:24,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 16:59:24,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:24,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 16:59:24,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2022-07-12 16:59:24,384 INFO L87 Difference]: Start difference. First operand 7952 states and 11349 transitions. Second operand has 15 states, 14 states have (on average 6.714285714285714) internal successors, (94), 13 states have internal predecessors, (94), 6 states have call successors, (32), 2 states have call predecessors, (32), 5 states have return successors, (30), 7 states have call predecessors, (30), 6 states have call successors, (30) [2022-07-12 16:59:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:26,652 INFO L93 Difference]: Finished difference Result 18550 states and 26899 transitions. [2022-07-12 16:59:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 16:59:26,653 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.714285714285714) internal successors, (94), 13 states have internal predecessors, (94), 6 states have call successors, (32), 2 states have call predecessors, (32), 5 states have return successors, (30), 7 states have call predecessors, (30), 6 states have call successors, (30) Word has length 248 [2022-07-12 16:59:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:26,685 INFO L225 Difference]: With dead ends: 18550 [2022-07-12 16:59:26,685 INFO L226 Difference]: Without dead ends: 10799 [2022-07-12 16:59:26,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=953, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 16:59:26,709 INFO L413 NwaCegarLoop]: 3024 mSDtfsCounter, 3456 mSDsluCounter, 37554 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 1625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3456 SdHoareTripleChecker+Valid, 40578 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1625 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:26,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3456 Valid, 40578 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1625 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 16:59:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10799 states. [2022-07-12 16:59:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10799 to 7976. [2022-07-12 16:59:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7976 states, 5353 states have (on average 1.2426676629927145) internal successors, (6652), 5603 states have internal predecessors, (6652), 2166 states have call successors, (2166), 424 states have call predecessors, (2166), 453 states have return successors, (2561), 2035 states have call predecessors, (2561), 2162 states have call successors, (2561) [2022-07-12 16:59:27,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 11379 transitions. [2022-07-12 16:59:27,519 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 11379 transitions. Word has length 248 [2022-07-12 16:59:27,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:27,520 INFO L495 AbstractCegarLoop]: Abstraction has 7976 states and 11379 transitions. [2022-07-12 16:59:27,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.714285714285714) internal successors, (94), 13 states have internal predecessors, (94), 6 states have call successors, (32), 2 states have call predecessors, (32), 5 states have return successors, (30), 7 states have call predecessors, (30), 6 states have call successors, (30) [2022-07-12 16:59:27,520 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 11379 transitions. [2022-07-12 16:59:27,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-12 16:59:27,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:27,523 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-12 16:59:27,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 16:59:27,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:59:27,740 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-12 16:59:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1971614400, now seen corresponding path program 1 times [2022-07-12 16:59:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:27,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495485826] [2022-07-12 16:59:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:27,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:28,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:28,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:28,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-12 16:59:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:28,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 16:59:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:28,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29