./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 791161d1 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-?-791161d [2022-07-23 04:13:13,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 04:13:13,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 04:13:13,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 04:13:13,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 04:13:13,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 04:13:13,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 04:13:13,279 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 04:13:13,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 04:13:13,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 04:13:13,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 04:13:13,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 04:13:13,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 04:13:13,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 04:13:13,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 04:13:13,286 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 04:13:13,287 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 04:13:13,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 04:13:13,289 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 04:13:13,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 04:13:13,291 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 04:13:13,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 04:13:13,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 04:13:13,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 04:13:13,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 04:13:13,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 04:13:13,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 04:13:13,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 04:13:13,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 04:13:13,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 04:13:13,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 04:13:13,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 04:13:13,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 04:13:13,306 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 04:13:13,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 04:13:13,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 04:13:13,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 04:13:13,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 04:13:13,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 04:13:13,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 04:13:13,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 04:13:13,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 04:13:13,315 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 04:13:13,347 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 04:13:13,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 04:13:13,351 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 04:13:13,352 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 04:13:13,353 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 04:13:13,353 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 04:13:13,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 04:13:13,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 04:13:13,354 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 04:13:13,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 04:13:13,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 04:13:13,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 04:13:13,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 04:13:13,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 04:13:13,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 04:13:13,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 04:13:13,356 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 04:13:13,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 04:13:13,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 04:13:13,356 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 04:13:13,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 04:13:13,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:13:13,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 04:13:13,357 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 04:13:13,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 04:13:13,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 04:13:13,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 04:13:13,358 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 04:13:13,358 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 04:13:13,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 04:13:13,359 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-23 04:13:13,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 04:13:13,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 04:13:13,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 04:13:13,640 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 04:13:13,641 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 04:13:13,642 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-23 04:13:13,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1110910e/2a1a879c72004186b7ddf8efe9f95460/FLAG12cd98f21 [2022-07-23 04:13:14,479 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 04:13:14,481 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-23 04:13:14,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1110910e/2a1a879c72004186b7ddf8efe9f95460/FLAG12cd98f21 [2022-07-23 04:13:15,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1110910e/2a1a879c72004186b7ddf8efe9f95460 [2022-07-23 04:13:15,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 04:13:15,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 04:13:15,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 04:13:15,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 04:13:15,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 04:13:15,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:13:15" (1/1) ... [2022-07-23 04:13:15,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441dcd38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:15, skipping insertion in model container [2022-07-23 04:13:15,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:13:15" (1/1) ... [2022-07-23 04:13:15,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 04:13:15,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 04:13:19,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[391473,391486] [2022-07-23 04:13:19,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[391929,391942] [2022-07-23 04:13:19,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392087,392100] [2022-07-23 04:13:19,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392245,392258] [2022-07-23 04:13:19,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,059 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392722,392735] [2022-07-23 04:13:19,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[392861,392874] [2022-07-23 04:13:19,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393003,393016] [2022-07-23 04:13:19,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393152,393165] [2022-07-23 04:13:19,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393291,393304] [2022-07-23 04:13:19,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393446,393459] [2022-07-23 04:13:19,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393606,393619] [2022-07-23 04:13:19,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393757,393770] [2022-07-23 04:13:19,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[393908,393921] [2022-07-23 04:13:19,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394060,394073] [2022-07-23 04:13:19,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394209,394222] [2022-07-23 04:13:19,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394357,394370] [2022-07-23 04:13:19,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394514,394527] [2022-07-23 04:13:19,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394663,394676] [2022-07-23 04:13:19,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394819,394832] [2022-07-23 04:13:19,072 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[394972,394985] [2022-07-23 04:13:19,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395118,395131] [2022-07-23 04:13:19,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395261,395274] [2022-07-23 04:13:19,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395413,395426] [2022-07-23 04:13:19,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395559,395572] [2022-07-23 04:13:19,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395704,395717] [2022-07-23 04:13:19,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[395858,395871] [2022-07-23 04:13:19,075 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396009,396022] [2022-07-23 04:13:19,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396164,396177] [2022-07-23 04:13:19,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396316,396329] [2022-07-23 04:13:19,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396471,396484] [2022-07-23 04:13:19,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396635,396648] [2022-07-23 04:13:19,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396791,396804] [2022-07-23 04:13:19,077 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[396955,396968] [2022-07-23 04:13:19,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397097,397110] [2022-07-23 04:13:19,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397255,397268] [2022-07-23 04:13:19,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397422,397435] [2022-07-23 04:13:19,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397581,397594] [2022-07-23 04:13:19,079 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i[397740,397753] [2022-07-23 04:13:19,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,103 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,105 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,106 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,109 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,111 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,116 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,119 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,121 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,123 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:13:19,182 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 04:13:19,576 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,592 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,599 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,608 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,608 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,610 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,623 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,625 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,627 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,638 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-23 04:13:19,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:13:20,003 INFO L208 MainTranslator]: Completed translation [2022-07-23 04:13:20,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:20 WrapperNode [2022-07-23 04:13:20,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 04:13:20,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 04:13:20,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 04:13:20,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 04:13:20,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:20" (1/1) ... [2022-07-23 04:13:20,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:20" (1/1) ... [2022-07-23 04:13:20,364 INFO L137 Inliner]: procedures = 624, calls = 2749, calls flagged for inlining = 307, calls inlined = 233, statements flattened = 6410 [2022-07-23 04:13:20,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 04:13:20,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 04:13:20,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 04:13:20,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 04:13:20,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:20" (1/1) ... [2022-07-23 04:13:20,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:20" (1/1) ... [2022-07-23 04:13:20,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:20" (1/1) ... [2022-07-23 04:13:20,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:20" (1/1) ... [2022-07-23 04:13:20,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:20" (1/1) ... [2022-07-23 04:13:20,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:20" (1/1) ... [2022-07-23 04:13:20,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:20" (1/1) ... [2022-07-23 04:13:20,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 04:13:20,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 04:13:20,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 04:13:20,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 04:13:20,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:20" (1/1) ... [2022-07-23 04:13:20,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:13:20,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:13:20,793 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-23 04:13:20,815 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-23 04:13:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:13:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:13:20,836 INFO L130 BoogieDeclarations]: Found specification of procedure mtouch_init [2022-07-23 04:13:20,836 INFO L138 BoogieDeclarations]: Found implementation of procedure mtouch_init [2022-07-23 04:13:20,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-23 04:13:20,836 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-23 04:13:20,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 04:13:20,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 04:13:20,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:13:20,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:13:20,838 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-07-23 04:13:20,838 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-07-23 04:13:20,838 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-23 04:13:20,838 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-23 04:13:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure idealtek_get_pkt_len [2022-07-23 04:13:20,839 INFO L138 BoogieDeclarations]: Found implementation of procedure idealtek_get_pkt_len [2022-07-23 04:13:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:13:20,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:13:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:13:20,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:13:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure eturbo_read_data [2022-07-23 04:13:20,841 INFO L138 BoogieDeclarations]: Found implementation of procedure eturbo_read_data [2022-07-23 04:13:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-07-23 04:13:20,841 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-07-23 04:13:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure eturbo_get_pkt_len [2022-07-23 04:13:20,841 INFO L138 BoogieDeclarations]: Found implementation of procedure eturbo_get_pkt_len [2022-07-23 04:13:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_input_dev [2022-07-23 04:13:20,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_mutex_of_input_dev [2022-07-23 04:13:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 04:13:20,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 04:13:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure mtouch_read_data [2022-07-23 04:13:20,842 INFO L138 BoogieDeclarations]: Found implementation of procedure mtouch_read_data [2022-07-23 04:13:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 04:13:20,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 04:13:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:13:20,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:13:20,843 INFO L130 BoogieDeclarations]: Found specification of procedure e2i_init [2022-07-23 04:13:20,843 INFO L138 BoogieDeclarations]: Found implementation of procedure e2i_init [2022-07-23 04:13:20,843 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_probe [2022-07-23 04:13:20,843 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_probe [2022-07-23 04:13:20,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 04:13:20,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_input_dev [2022-07-23 04:13:20,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_mutex_of_input_dev [2022-07-23 04:13:20,844 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-23 04:13:20,844 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-23 04:13:20,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:13:20,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:13:20,844 INFO L130 BoogieDeclarations]: Found specification of procedure e2i_read_data [2022-07-23 04:13:20,845 INFO L138 BoogieDeclarations]: Found implementation of procedure e2i_read_data [2022-07-23 04:13:20,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-23 04:13:20,845 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_multi [2022-07-23 04:13:20,845 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_multi [2022-07-23 04:13:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-23 04:13:20,846 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-23 04:13:20,846 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-23 04:13:20,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-23 04:13:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure egalax_init [2022-07-23 04:13:20,847 INFO L138 BoogieDeclarations]: Found implementation of procedure egalax_init [2022-07-23 04:13:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-23 04:13:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-23 04:13:20,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-23 04:13:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 04:13:20,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 04:13:20,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:13:20,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:13:20,848 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-07-23 04:13:20,848 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-07-23 04:13:20,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 04:13:20,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:13:20,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:13:20,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-23 04:13:20,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-23 04:13:20,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-23 04:13:20,853 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-23 04:13:20,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:13:20,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:13:20,853 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-23 04:13:20,854 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-23 04:13:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-23 04:13:20,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-23 04:13:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure kstrdup [2022-07-23 04:13:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrdup [2022-07-23 04:13:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:13:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:13:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure panjit_read_data [2022-07-23 04:13:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure panjit_read_data [2022-07-23 04:13:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_alloc [2022-07-23 04:13:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_alloc [2022-07-23 04:13:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:13:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:13:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure etouch_get_pkt_len [2022-07-23 04:13:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure etouch_get_pkt_len [2022-07-23 04:13:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 04:13:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure elo_read_data [2022-07-23 04:13:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure elo_read_data [2022-07-23 04:13:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_free_buffers [2022-07-23 04:13:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_free_buffers [2022-07-23 04:13:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure general_touch_read_data [2022-07-23 04:13:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure general_touch_read_data [2022-07-23 04:13:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 04:13:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 04:13:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 04:13:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 04:13:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:13:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-23 04:13:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:13:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-23 04:13:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-23 04:13:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-23 04:13:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-23 04:13:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-23 04:13:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2022-07-23 04:13:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2022-07-23 04:13:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:13:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:13:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-23 04:13:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-23 04:13:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 04:13:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 04:13:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-23 04:13:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-23 04:13:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-23 04:13:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-23 04:13:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 04:13:20,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 04:13:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_resume [2022-07-23 04:13:20,862 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_resume [2022-07-23 04:13:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-07-23 04:13:20,862 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-07-23 04:13:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-23 04:13:20,862 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-23 04:13:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure zytronic_read_data [2022-07-23 04:13:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure zytronic_read_data [2022-07-23 04:13:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure gunze_read_data [2022-07-23 04:13:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure gunze_read_data [2022-07-23 04:13:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_disconnect [2022-07-23 04:13:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_disconnect [2022-07-23 04:13:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:13:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:13:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure tc45usb_read_data [2022-07-23 04:13:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure tc45usb_read_data [2022-07-23 04:13:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-23 04:13:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-23 04:13:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:13:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:13:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_exit [2022-07-23 04:13:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_exit [2022-07-23 04:13:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 04:13:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:13:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:13:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_init [2022-07-23 04:13:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_init [2022-07-23 04:13:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 04:13:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure gotop_read_data [2022-07-23 04:13:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure gotop_read_data [2022-07-23 04:13:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-23 04:13:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-23 04:13:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2022-07-23 04:13:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2022-07-23 04:13:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 04:13:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure jastec_read_data [2022-07-23 04:13:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure jastec_read_data [2022-07-23 04:13:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure egalax_get_pkt_len [2022-07-23 04:13:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure egalax_get_pkt_len [2022-07-23 04:13:20,867 INFO L130 BoogieDeclarations]: Found specification of procedure etouch_read_data [2022-07-23 04:13:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure etouch_read_data [2022-07-23 04:13:20,867 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-23 04:13:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-23 04:13:20,868 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-23 04:13:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-23 04:13:20,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:13:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:13:20,868 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_irq [2022-07-23 04:13:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_irq [2022-07-23 04:13:20,868 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-23 04:13:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-23 04:13:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 04:13:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 04:13:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure nexio_read_data [2022-07-23 04:13:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure nexio_read_data [2022-07-23 04:13:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-23 04:13:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-23 04:13:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2022-07-23 04:13:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2022-07-23 04:13:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-23 04:13:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-23 04:13:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-23 04:13:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-23 04:13:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-23 04:13:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-23 04:13:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:13:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:13:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:13:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-23 04:13:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:13:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:13:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure itm_read_data [2022-07-23 04:13:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure itm_read_data [2022-07-23 04:13:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-23 04:13:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-23 04:13:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:13:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:13:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-23 04:13:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-23 04:13:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-23 04:13:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-23 04:13:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:13:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-23 04:13:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_reset_resume [2022-07-23 04:13:20,873 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_reset_resume [2022-07-23 04:13:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 04:13:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:13:20,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:13:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 04:13:20,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 04:13:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:13:20,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:13:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-23 04:13:20,874 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-23 04:13:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-23 04:13:20,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-23 04:13:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure idealtek_read_data [2022-07-23 04:13:20,874 INFO L138 BoogieDeclarations]: Found implementation of procedure idealtek_read_data [2022-07-23 04:13:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:13:20,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:13:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-23 04:13:20,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-23 04:13:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure usbtouch_process_pkt [2022-07-23 04:13:20,875 INFO L138 BoogieDeclarations]: Found implementation of procedure usbtouch_process_pkt [2022-07-23 04:13:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 04:13:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure irtouch_read_data [2022-07-23 04:13:20,875 INFO L138 BoogieDeclarations]: Found implementation of procedure irtouch_read_data [2022-07-23 04:13:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure egalax_read_data [2022-07-23 04:13:20,875 INFO L138 BoogieDeclarations]: Found implementation of procedure egalax_read_data [2022-07-23 04:13:21,995 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 04:13:21,999 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 04:13:22,319 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 04:13:27,307 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 04:13:27,331 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 04:13:27,331 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 04:13:27,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:13:27 BoogieIcfgContainer [2022-07-23 04:13:27,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 04:13:27,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 04:13:27,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 04:13:27,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 04:13:27,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 04:13:15" (1/3) ... [2022-07-23 04:13:27,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c4c6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:13:27, skipping insertion in model container [2022-07-23 04:13:27,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:13:20" (2/3) ... [2022-07-23 04:13:27,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c4c6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:13:27, skipping insertion in model container [2022-07-23 04:13:27,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:13:27" (3/3) ... [2022-07-23 04:13:27,346 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--input--touchscreen--usbtouchscreen.ko.cil.i [2022-07-23 04:13:27,358 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 04:13:27,359 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-23 04:13:27,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 04:13:27,459 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@30ea040, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@574510a7 [2022-07-23 04:13:27,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-23 04:13:27,472 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-23 04:13:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-23 04:13:27,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:27,487 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-23 04:13:27,487 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-23 04:13:27,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1025561447, now seen corresponding path program 1 times [2022-07-23 04:13:27,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:27,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969362898] [2022-07-23 04:13:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:27,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:28,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:28,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:13:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:28,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:13:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:28,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:13:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:28,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:13:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:28,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:13:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:28,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:28,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:13:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:28,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:13:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:28,518 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-23 04:13:28,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:28,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969362898] [2022-07-23 04:13:28,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969362898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:28,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:28,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:28,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999700400] [2022-07-23 04:13:28,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:28,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:28,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:28,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:28,559 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-23 04:13:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:35,091 INFO L93 Difference]: Finished difference Result 4114 states and 5903 transitions. [2022-07-23 04:13:35,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:13:35,097 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-23 04:13:35,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:35,138 INFO L225 Difference]: With dead ends: 4114 [2022-07-23 04:13:35,138 INFO L226 Difference]: Without dead ends: 2048 [2022-07-23 04:13:35,160 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-23 04:13:35,164 INFO L413 NwaCegarLoop]: 2628 mSDtfsCounter, 4192 mSDsluCounter, 2351 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 2062 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s 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.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:35,165 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.9s Time] [2022-07-23 04:13:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2022-07-23 04:13:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2022-07-23 04:13:35,446 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-23 04:13:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2813 transitions. [2022-07-23 04:13:35,467 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2813 transitions. Word has length 71 [2022-07-23 04:13:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:35,469 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2813 transitions. [2022-07-23 04:13:35,470 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-23 04:13:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2813 transitions. [2022-07-23 04:13:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-23 04:13:35,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:35,473 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-23 04:13:35,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 04:13:35,474 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-23 04:13:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:35,475 INFO L85 PathProgramCache]: Analyzing trace with hash 331542922, now seen corresponding path program 1 times [2022-07-23 04:13:35,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:35,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311176765] [2022-07-23 04:13:35,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:35,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:35,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:35,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:35,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:13:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:35,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:13:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:35,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:13:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:35,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:13:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:35,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:13:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:35,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:35,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:13:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:35,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:13:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:36,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:13:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:36,029 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-23 04:13:36,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:36,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311176765] [2022-07-23 04:13:36,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311176765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:36,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:36,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:36,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080570503] [2022-07-23 04:13:36,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:36,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:36,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:36,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:36,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:36,034 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-23 04:13:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:41,187 INFO L93 Difference]: Finished difference Result 2048 states and 2813 transitions. [2022-07-23 04:13:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:13:41,188 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-23 04:13:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:41,203 INFO L225 Difference]: With dead ends: 2048 [2022-07-23 04:13:41,204 INFO L226 Difference]: Without dead ends: 2046 [2022-07-23 04:13:41,206 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-23 04:13:41,209 INFO L413 NwaCegarLoop]: 2578 mSDtfsCounter, 4128 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:41,209 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.9s Time] [2022-07-23 04:13:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2022-07-23 04:13:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 2046. [2022-07-23 04:13:41,383 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-23 04:13:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2811 transitions. [2022-07-23 04:13:41,402 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2811 transitions. Word has length 77 [2022-07-23 04:13:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:41,405 INFO L495 AbstractCegarLoop]: Abstraction has 2046 states and 2811 transitions. [2022-07-23 04:13:41,405 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-23 04:13:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2811 transitions. [2022-07-23 04:13:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-23 04:13:41,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:41,412 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-23 04:13:41,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 04:13:41,412 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-23 04:13:41,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:41,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1730925904, now seen corresponding path program 1 times [2022-07-23 04:13:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:41,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586903678] [2022-07-23 04:13:41,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:41,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:13:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:13:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:13:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:13:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:13:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:13:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:13:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:13:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:13:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:41,909 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-23 04:13:41,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:41,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586903678] [2022-07-23 04:13:41,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586903678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:41,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:41,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:41,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318408255] [2022-07-23 04:13:41,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:41,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:41,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:41,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:41,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:41,913 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-23 04:13:47,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:47,211 INFO L93 Difference]: Finished difference Result 2046 states and 2811 transitions. [2022-07-23 04:13:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:13:47,216 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-23 04:13:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:47,230 INFO L225 Difference]: With dead ends: 2046 [2022-07-23 04:13:47,231 INFO L226 Difference]: Without dead ends: 2044 [2022-07-23 04:13:47,233 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-23 04:13:47,234 INFO L413 NwaCegarLoop]: 2576 mSDtfsCounter, 4122 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2711 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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, 5.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:47,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4428 Valid, 4847 Invalid, 4733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2711 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-23 04:13:47,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2022-07-23 04:13:47,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2022-07-23 04:13:47,318 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-23 04:13:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2809 transitions. [2022-07-23 04:13:47,334 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2809 transitions. Word has length 83 [2022-07-23 04:13:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:47,335 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2809 transitions. [2022-07-23 04:13:47,335 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-23 04:13:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2809 transitions. [2022-07-23 04:13:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-23 04:13:47,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:47,337 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-23 04:13:47,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 04:13:47,337 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-23 04:13:47,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:47,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1404582892, now seen corresponding path program 1 times [2022-07-23 04:13:47,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:47,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206444365] [2022-07-23 04:13:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:47,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:13:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:13:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:13:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:13:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:13:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:13:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:13:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:13:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:13:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:13:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:47,783 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-23 04:13:47,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:47,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206444365] [2022-07-23 04:13:47,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206444365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:47,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:47,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:47,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833332737] [2022-07-23 04:13:47,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:47,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:47,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:47,787 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-23 04:13:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:52,523 INFO L93 Difference]: Finished difference Result 2044 states and 2809 transitions. [2022-07-23 04:13:52,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:13:52,524 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-23 04:13:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:52,535 INFO L225 Difference]: With dead ends: 2044 [2022-07-23 04:13:52,536 INFO L226 Difference]: Without dead ends: 2042 [2022-07-23 04:13:52,537 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-23 04:13:52,538 INFO L413 NwaCegarLoop]: 2574 mSDtfsCounter, 4116 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2709 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:52,538 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.5s Time] [2022-07-23 04:13:52,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2022-07-23 04:13:52,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2022-07-23 04:13:52,628 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-23 04:13:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2807 transitions. [2022-07-23 04:13:52,641 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2807 transitions. Word has length 89 [2022-07-23 04:13:52,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:52,642 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 2807 transitions. [2022-07-23 04:13:52,642 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-23 04:13:52,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2807 transitions. [2022-07-23 04:13:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-23 04:13:52,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:52,644 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-23 04:13:52,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 04:13:52,644 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-23 04:13:52,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1494357745, now seen corresponding path program 1 times [2022-07-23 04:13:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:52,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855083903] [2022-07-23 04:13:52,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:52,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:13:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:52,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:13:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:13:53,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:13:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:13:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:13:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:13:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:13:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:13:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:13:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:13:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:53,099 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-23 04:13:53,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:53,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855083903] [2022-07-23 04:13:53,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855083903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:53,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:53,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:53,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053055404] [2022-07-23 04:13:53,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:53,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:53,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:53,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:53,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:53,102 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-23 04:13:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:13:57,546 INFO L93 Difference]: Finished difference Result 2042 states and 2807 transitions. [2022-07-23 04:13:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:13:57,546 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-23 04:13:57,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:13:57,557 INFO L225 Difference]: With dead ends: 2042 [2022-07-23 04:13:57,557 INFO L226 Difference]: Without dead ends: 2040 [2022-07-23 04:13:57,559 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-23 04:13:57,560 INFO L413 NwaCegarLoop]: 2572 mSDtfsCounter, 4110 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2707 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:13:57,560 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.2s Time] [2022-07-23 04:13:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2022-07-23 04:13:57,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 2040. [2022-07-23 04:13:57,638 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-23 04:13:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2805 transitions. [2022-07-23 04:13:57,648 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2805 transitions. Word has length 95 [2022-07-23 04:13:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:13:57,649 INFO L495 AbstractCegarLoop]: Abstraction has 2040 states and 2805 transitions. [2022-07-23 04:13:57,649 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-23 04:13:57,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2805 transitions. [2022-07-23 04:13:57,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-23 04:13:57,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:13:57,651 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-23 04:13:57,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 04:13:57,651 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-23 04:13:57,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:13:57,652 INFO L85 PathProgramCache]: Analyzing trace with hash -996249196, now seen corresponding path program 1 times [2022-07-23 04:13:57,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:13:57,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30086021] [2022-07-23 04:13:57,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:13:57,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:13:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:57,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:13:57,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:57,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:13:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:57,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:13:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:57,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:13:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:13:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:57,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:13:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:58,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:13:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:58,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:13:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:58,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:13:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:13:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:58,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:13:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:58,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:13:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:58,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:13:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:58,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:13:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:13:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:13:58,086 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-23 04:13:58,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:13:58,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30086021] [2022-07-23 04:13:58,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30086021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:13:58,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:13:58,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:13:58,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955926732] [2022-07-23 04:13:58,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:13:58,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:13:58,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:13:58,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:13:58,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:13:58,089 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-23 04:14:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:02,729 INFO L93 Difference]: Finished difference Result 2040 states and 2805 transitions. [2022-07-23 04:14:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:02,731 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-23 04:14:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:02,740 INFO L225 Difference]: With dead ends: 2040 [2022-07-23 04:14:02,740 INFO L226 Difference]: Without dead ends: 2038 [2022-07-23 04:14:02,741 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-23 04:14:02,743 INFO L413 NwaCegarLoop]: 2570 mSDtfsCounter, 4104 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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, 4.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:02,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4407 Valid, 4841 Invalid, 4727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-23 04:14:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2022-07-23 04:14:02,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 2038. [2022-07-23 04:14:02,841 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-23 04:14:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2803 transitions. [2022-07-23 04:14:02,853 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2803 transitions. Word has length 101 [2022-07-23 04:14:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:02,853 INFO L495 AbstractCegarLoop]: Abstraction has 2038 states and 2803 transitions. [2022-07-23 04:14:02,854 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-23 04:14:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2803 transitions. [2022-07-23 04:14:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-23 04:14:02,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:02,855 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-23 04:14:02,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 04:14:02,856 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-23 04:14:02,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:02,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2062134940, now seen corresponding path program 1 times [2022-07-23 04:14:02,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:02,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402276868] [2022-07-23 04:14:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:02,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:14:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:14:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:14:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:14:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:14:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:14:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:14:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:14:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:14:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:03,884 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-23 04:14:03,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:03,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402276868] [2022-07-23 04:14:03,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402276868] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:14:03,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032497403] [2022-07-23 04:14:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:03,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:14:03,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:14:03,887 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-23 04:14:03,891 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-23 04:14:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:05,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 3969 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-23 04:14:05,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:14:05,613 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-23 04:14:05,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:14:05,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032497403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:05,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:14:05,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [21] total 31 [2022-07-23 04:14:05,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167386873] [2022-07-23 04:14:05,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:05,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-23 04:14:05,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:05,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-23 04:14:05,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2022-07-23 04:14:05,620 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-23 04:14:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:06,608 INFO L93 Difference]: Finished difference Result 4106 states and 5659 transitions. [2022-07-23 04:14:06,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 04:14:06,608 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-23 04:14:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:06,625 INFO L225 Difference]: With dead ends: 4106 [2022-07-23 04:14:06,625 INFO L226 Difference]: Without dead ends: 2082 [2022-07-23 04:14:06,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1569, Unknown=0, NotChecked=0, Total=1806 [2022-07-23 04:14:06,639 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-23 04:14:06,640 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-23 04:14:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2022-07-23 04:14:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2058. [2022-07-23 04:14:06,748 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-23 04:14:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 2829 transitions. [2022-07-23 04:14:06,760 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 2829 transitions. Word has length 116 [2022-07-23 04:14:06,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:06,761 INFO L495 AbstractCegarLoop]: Abstraction has 2058 states and 2829 transitions. [2022-07-23 04:14:06,761 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-23 04:14:06,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 2829 transitions. [2022-07-23 04:14:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-23 04:14:06,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:06,763 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-23 04:14:06,808 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-23 04:14:06,987 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-23 04:14:06,987 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-23 04:14:06,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash 925689958, now seen corresponding path program 1 times [2022-07-23 04:14:06,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:06,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662057238] [2022-07-23 04:14:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:14:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:14:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:14:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:14:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:14:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:14:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:14:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-23 04:14:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:14:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:07,651 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-23 04:14:07,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:07,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662057238] [2022-07-23 04:14:07,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662057238] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:14:07,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231710923] [2022-07-23 04:14:07,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:07,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:14:07,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:14:07,656 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-23 04:14:07,658 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-23 04:14:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:08,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 3967 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 04:14:08,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:14:08,867 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-23 04:14:08,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:14:08,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231710923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:08,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:14:08,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 9 [2022-07-23 04:14:08,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651929649] [2022-07-23 04:14:08,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:08,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:08,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:08,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:08,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:14:08,870 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-23 04:14:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:09,807 INFO L93 Difference]: Finished difference Result 4013 states and 5523 transitions. [2022-07-23 04:14:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:09,808 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-23 04:14:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:09,819 INFO L225 Difference]: With dead ends: 4013 [2022-07-23 04:14:09,819 INFO L226 Difference]: Without dead ends: 2080 [2022-07-23 04:14:09,831 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-23 04:14:09,831 INFO L413 NwaCegarLoop]: 2848 mSDtfsCounter, 1288 mSDsluCounter, 9436 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:09,832 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.7s Time] [2022-07-23 04:14:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2022-07-23 04:14:09,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2056. [2022-07-23 04:14:09,939 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-23 04:14:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2825 transitions. [2022-07-23 04:14:09,951 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2825 transitions. Word has length 116 [2022-07-23 04:14:09,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:09,952 INFO L495 AbstractCegarLoop]: Abstraction has 2056 states and 2825 transitions. [2022-07-23 04:14:09,958 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-23 04:14:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2825 transitions. [2022-07-23 04:14:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-23 04:14:09,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:09,961 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-23 04:14:10,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-23 04:14:10,175 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-23 04:14:10,176 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-23 04:14:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:10,176 INFO L85 PathProgramCache]: Analyzing trace with hash -97827155, now seen corresponding path program 1 times [2022-07-23 04:14:10,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:10,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892981685] [2022-07-23 04:14:10,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:10,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:14:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:14:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:14:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:14:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:14:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:14:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:14:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:14:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:14:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:14:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:10,640 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-23 04:14:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:10,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892981685] [2022-07-23 04:14:10,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892981685] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:10,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:10,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:10,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414166309] [2022-07-23 04:14:10,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:10,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:10,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:10,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:10,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:10,643 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-23 04:14:15,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:15,835 INFO L93 Difference]: Finished difference Result 2056 states and 2825 transitions. [2022-07-23 04:14:15,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:15,836 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-23 04:14:15,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:15,850 INFO L225 Difference]: With dead ends: 2056 [2022-07-23 04:14:15,850 INFO L226 Difference]: Without dead ends: 2054 [2022-07-23 04:14:15,853 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-23 04:14:15,854 INFO L413 NwaCegarLoop]: 2568 mSDtfsCounter, 4098 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2703 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:15,854 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.9s Time] [2022-07-23 04:14:15,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2022-07-23 04:14:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 2054. [2022-07-23 04:14:16,010 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-23 04:14:16,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2823 transitions. [2022-07-23 04:14:16,022 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2823 transitions. Word has length 107 [2022-07-23 04:14:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:16,022 INFO L495 AbstractCegarLoop]: Abstraction has 2054 states and 2823 transitions. [2022-07-23 04:14:16,023 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-23 04:14:16,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2823 transitions. [2022-07-23 04:14:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-23 04:14:16,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:16,025 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-23 04:14:16,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 04:14:16,026 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-23 04:14:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2138249491, now seen corresponding path program 1 times [2022-07-23 04:14:16,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:16,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471245751] [2022-07-23 04:14:16,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:14:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:14:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:14:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:14:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:14:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:14:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:14:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:14:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:14:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:14:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:14:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,490 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-23 04:14:16,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:16,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471245751] [2022-07-23 04:14:16,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471245751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:16,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:16,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:16,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15616429] [2022-07-23 04:14:16,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:16,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:16,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:16,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:16,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:16,493 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-23 04:14:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:21,946 INFO L93 Difference]: Finished difference Result 2054 states and 2823 transitions. [2022-07-23 04:14:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:21,947 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-23 04:14:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:21,958 INFO L225 Difference]: With dead ends: 2054 [2022-07-23 04:14:21,959 INFO L226 Difference]: Without dead ends: 2052 [2022-07-23 04:14:21,961 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-23 04:14:21,961 INFO L413 NwaCegarLoop]: 2566 mSDtfsCounter, 4096 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s 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, 5.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:21,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4397 Valid, 4837 Invalid, 4719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-23 04:14:21,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2022-07-23 04:14:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 2052. [2022-07-23 04:14:22,102 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-23 04:14:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2821 transitions. [2022-07-23 04:14:22,113 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2821 transitions. Word has length 113 [2022-07-23 04:14:22,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:22,114 INFO L495 AbstractCegarLoop]: Abstraction has 2052 states and 2821 transitions. [2022-07-23 04:14:22,114 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-23 04:14:22,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2821 transitions. [2022-07-23 04:14:22,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-23 04:14:22,115 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:22,116 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-23 04:14:22,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 04:14:22,116 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-23 04:14:22,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:22,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1863528822, now seen corresponding path program 1 times [2022-07-23 04:14:22,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:22,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942454545] [2022-07-23 04:14:22,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:14:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:14:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:14:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:14:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:14:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:14:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:14:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:14:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:14:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:14:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:14:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:22,495 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-23 04:14:22,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:22,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942454545] [2022-07-23 04:14:22,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942454545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:22,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:22,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755225919] [2022-07-23 04:14:22,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:22,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:22,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:22,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:22,498 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-23 04:14:27,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:27,548 INFO L93 Difference]: Finished difference Result 2052 states and 2821 transitions. [2022-07-23 04:14:27,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:27,548 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-23 04:14:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:27,562 INFO L225 Difference]: With dead ends: 2052 [2022-07-23 04:14:27,562 INFO L226 Difference]: Without dead ends: 2050 [2022-07-23 04:14:27,565 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-23 04:14:27,565 INFO L413 NwaCegarLoop]: 2564 mSDtfsCounter, 4084 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.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, 4.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:27,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4385 Valid, 4835 Invalid, 4721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2699 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-23 04:14:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2022-07-23 04:14:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2022-07-23 04:14:27,713 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-23 04:14:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2819 transitions. [2022-07-23 04:14:27,724 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2819 transitions. Word has length 115 [2022-07-23 04:14:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:27,725 INFO L495 AbstractCegarLoop]: Abstraction has 2050 states and 2819 transitions. [2022-07-23 04:14:27,725 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-23 04:14:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2819 transitions. [2022-07-23 04:14:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-23 04:14:27,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:27,727 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-23 04:14:27,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 04:14:27,727 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-23 04:14:27,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash 656543310, now seen corresponding path program 1 times [2022-07-23 04:14:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:27,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317473234] [2022-07-23 04:14:27,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:27,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:14:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:14:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:14:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:14:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:14:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:14:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:14:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:14:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:14:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:14:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:14:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:14:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:28,118 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-23 04:14:28,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:28,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317473234] [2022-07-23 04:14:28,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317473234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:28,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:28,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077079506] [2022-07-23 04:14:28,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:28,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:28,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:28,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:28,121 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-23 04:14:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:32,565 INFO L93 Difference]: Finished difference Result 2050 states and 2819 transitions. [2022-07-23 04:14:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:32,565 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-23 04:14:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:32,575 INFO L225 Difference]: With dead ends: 2050 [2022-07-23 04:14:32,576 INFO L226 Difference]: Without dead ends: 2048 [2022-07-23 04:14:32,577 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-23 04:14:32,577 INFO L413 NwaCegarLoop]: 2562 mSDtfsCounter, 4080 mSDsluCounter, 2271 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s 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, 4.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:32,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4380 Valid, 4833 Invalid, 4719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-23 04:14:32,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2022-07-23 04:14:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2022-07-23 04:14:32,683 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-23 04:14:32,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2817 transitions. [2022-07-23 04:14:32,694 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2817 transitions. Word has length 121 [2022-07-23 04:14:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:32,695 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2817 transitions. [2022-07-23 04:14:32,695 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-23 04:14:32,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2817 transitions. [2022-07-23 04:14:32,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-23 04:14:32,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:32,697 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-23 04:14:32,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 04:14:32,698 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-23 04:14:32,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:32,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1147805020, now seen corresponding path program 1 times [2022-07-23 04:14:32,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:32,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385964848] [2022-07-23 04:14:32,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:32,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:14:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:14:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:14:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:14:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:14:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:14:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:14:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:14:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:14:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:33,240 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-23 04:14:33,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:33,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385964848] [2022-07-23 04:14:33,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385964848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:33,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:33,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:14:33,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373807311] [2022-07-23 04:14:33,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:33,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:14:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:33,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:14:33,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:14:33,242 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-23 04:14:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:41,809 INFO L93 Difference]: Finished difference Result 4256 states and 5931 transitions. [2022-07-23 04:14:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:41,809 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-23 04:14:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:41,823 INFO L225 Difference]: With dead ends: 4256 [2022-07-23 04:14:41,823 INFO L226 Difference]: Without dead ends: 2267 [2022-07-23 04:14:41,831 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-23 04:14:41,832 INFO L413 NwaCegarLoop]: 2155 mSDtfsCounter, 5120 mSDsluCounter, 2567 mSDsCounter, 0 mSdLazyCounter, 3636 mSolverCounterSat, 3303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5462 SdHoareTripleChecker+Valid, 4722 SdHoareTripleChecker+Invalid, 6939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3303 IncrementalHoareTripleChecker+Valid, 3636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:41,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5462 Valid, 4722 Invalid, 6939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3303 Valid, 3636 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-07-23 04:14:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2022-07-23 04:14:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 2044. [2022-07-23 04:14:41,972 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-23 04:14:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2812 transitions. [2022-07-23 04:14:41,983 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2812 transitions. Word has length 163 [2022-07-23 04:14:41,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:41,984 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2812 transitions. [2022-07-23 04:14:41,985 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-23 04:14:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2812 transitions. [2022-07-23 04:14:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-23 04:14:41,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:41,986 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-23 04:14:41,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 04:14:41,987 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-23 04:14:41,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1112029439, now seen corresponding path program 1 times [2022-07-23 04:14:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:41,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122048549] [2022-07-23 04:14:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:41,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:14:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:14:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:14:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:14:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:14:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:14:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:14:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:14:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:14:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:14:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:14:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:14:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:14:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:42,428 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-23 04:14:42,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:42,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122048549] [2022-07-23 04:14:42,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122048549] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:42,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:42,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:42,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935342502] [2022-07-23 04:14:42,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:42,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:42,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:42,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:42,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:42,432 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-23 04:14:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:46,990 INFO L93 Difference]: Finished difference Result 2044 states and 2812 transitions. [2022-07-23 04:14:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:46,990 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-23 04:14:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:47,002 INFO L225 Difference]: With dead ends: 2044 [2022-07-23 04:14:47,002 INFO L226 Difference]: Without dead ends: 2042 [2022-07-23 04:14:47,005 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-23 04:14:47,006 INFO L413 NwaCegarLoop]: 2555 mSDtfsCounter, 4069 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 2694 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:47,006 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.3s Time] [2022-07-23 04:14:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2022-07-23 04:14:47,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2022-07-23 04:14:47,132 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-23 04:14:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2810 transitions. [2022-07-23 04:14:47,142 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2810 transitions. Word has length 127 [2022-07-23 04:14:47,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:47,143 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 2810 transitions. [2022-07-23 04:14:47,143 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-23 04:14:47,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2810 transitions. [2022-07-23 04:14:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-23 04:14:47,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:47,145 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-23 04:14:47,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 04:14:47,146 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-23 04:14:47,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:47,146 INFO L85 PathProgramCache]: Analyzing trace with hash 624354067, now seen corresponding path program 1 times [2022-07-23 04:14:47,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:47,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688627329] [2022-07-23 04:14:47,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:47,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:14:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:14:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:14:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:14:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:14:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:14:47,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:14:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:14:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:14:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 04:14:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:47,728 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-23 04:14:47,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:47,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688627329] [2022-07-23 04:14:47,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688627329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:14:47,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785586952] [2022-07-23 04:14:47,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:47,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:14:47,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:14:47,731 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-23 04:14:47,755 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-23 04:14:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:49,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 4362 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 04:14:49,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:14:49,132 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-23 04:14:49,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:14:49,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785586952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:49,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:14:49,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-23 04:14:49,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041260751] [2022-07-23 04:14:49,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:49,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 04:14:49,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:49,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 04:14:49,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:14:49,135 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-23 04:14:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:49,336 INFO L93 Difference]: Finished difference Result 4029 states and 5537 transitions. [2022-07-23 04:14:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 04:14:49,337 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-23 04:14:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:49,347 INFO L225 Difference]: With dead ends: 4029 [2022-07-23 04:14:49,347 INFO L226 Difference]: Without dead ends: 2049 [2022-07-23 04:14:49,355 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-23 04:14:49,356 INFO L413 NwaCegarLoop]: 2797 mSDtfsCounter, 2754 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:49,356 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.1s Time] [2022-07-23 04:14:49,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2022-07-23 04:14:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2048. [2022-07-23 04:14:49,490 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-23 04:14:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2812 transitions. [2022-07-23 04:14:49,501 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2812 transitions. Word has length 169 [2022-07-23 04:14:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:49,501 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2812 transitions. [2022-07-23 04:14:49,502 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-23 04:14:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2812 transitions. [2022-07-23 04:14:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-23 04:14:49,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:49,504 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-23 04:14:49,542 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-23 04:14:49,719 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-23 04:14:49,720 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-23 04:14:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash -341229517, now seen corresponding path program 1 times [2022-07-23 04:14:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:49,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197515490] [2022-07-23 04:14:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:49,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:14:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:14:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:14:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:14:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:14:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:14:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:14:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:14:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-23 04:14:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-23 04:14:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:50,196 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-23 04:14:50,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:50,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197515490] [2022-07-23 04:14:50,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197515490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:50,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:50,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:14:50,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218120257] [2022-07-23 04:14:50,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:50,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:14:50,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:50,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:14:50,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:14:50,200 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-23 04:14:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:58,239 INFO L93 Difference]: Finished difference Result 2171 states and 3031 transitions. [2022-07-23 04:14:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:14:58,239 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-23 04:14:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:58,248 INFO L225 Difference]: With dead ends: 2171 [2022-07-23 04:14:58,248 INFO L226 Difference]: Without dead ends: 2169 [2022-07-23 04:14:58,249 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-23 04:14:58,250 INFO L413 NwaCegarLoop]: 2546 mSDtfsCounter, 2909 mSDsluCounter, 3847 mSDsCounter, 0 mSdLazyCounter, 5644 mSolverCounterSat, 2422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 6393 SdHoareTripleChecker+Invalid, 8066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2422 IncrementalHoareTripleChecker+Valid, 5644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:58,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 6393 Invalid, 8066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2422 Valid, 5644 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-07-23 04:14:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2022-07-23 04:14:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2050. [2022-07-23 04:14:58,436 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-23 04:14:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2814 transitions. [2022-07-23 04:14:58,446 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2814 transitions. Word has length 175 [2022-07-23 04:14:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:58,448 INFO L495 AbstractCegarLoop]: Abstraction has 2050 states and 2814 transitions. [2022-07-23 04:14:58,448 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-23 04:14:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2814 transitions. [2022-07-23 04:14:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-23 04:14:58,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:58,450 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-23 04:14:58,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 04:14:58,451 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-23 04:14:58,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:58,452 INFO L85 PathProgramCache]: Analyzing trace with hash -341289099, now seen corresponding path program 1 times [2022-07-23 04:14:58,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:58,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013674927] [2022-07-23 04:14:58,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:58,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:14:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:14:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:14:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:14:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:14:58,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:14:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:14:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:14:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:14:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:14:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-23 04:14:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-23 04:14:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:58,931 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-23 04:14:58,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:58,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013674927] [2022-07-23 04:14:58,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013674927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:58,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:58,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:14:58,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368742517] [2022-07-23 04:14:58,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:58,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:14:58,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:58,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:14:58,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:14:58,935 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-23 04:15:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:07,655 INFO L93 Difference]: Finished difference Result 4154 states and 5788 transitions. [2022-07-23 04:15:07,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 04:15:07,656 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-23 04:15:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:07,665 INFO L225 Difference]: With dead ends: 4154 [2022-07-23 04:15:07,665 INFO L226 Difference]: Without dead ends: 2170 [2022-07-23 04:15:07,672 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-23 04:15:07,673 INFO L413 NwaCegarLoop]: 2549 mSDtfsCounter, 2897 mSDsluCounter, 3847 mSDsCounter, 0 mSdLazyCounter, 5666 mSolverCounterSat, 2410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s 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.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:07,673 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.4s Time] [2022-07-23 04:15:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2170 states. [2022-07-23 04:15:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2170 to 2052. [2022-07-23 04:15:07,815 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-23 04:15:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2816 transitions. [2022-07-23 04:15:07,827 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2816 transitions. Word has length 175 [2022-07-23 04:15:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:07,827 INFO L495 AbstractCegarLoop]: Abstraction has 2052 states and 2816 transitions. [2022-07-23 04:15:07,827 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-23 04:15:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2816 transitions. [2022-07-23 04:15:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-23 04:15:07,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:07,829 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-23 04:15:07,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 04:15:07,830 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-23 04:15:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash -989632069, now seen corresponding path program 1 times [2022-07-23 04:15:07,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:07,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763978818] [2022-07-23 04:15:07,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:07,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:15:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:15:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:15:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:15:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:15:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:15:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:15:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:15:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:15:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:08,257 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-23 04:15:08,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:08,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763978818] [2022-07-23 04:15:08,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763978818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:08,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:08,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:08,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027826738] [2022-07-23 04:15:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:08,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:08,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:08,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:08,260 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-23 04:15:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:13,079 INFO L93 Difference]: Finished difference Result 2052 states and 2816 transitions. [2022-07-23 04:15:13,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:13,083 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-23 04:15:13,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:13,092 INFO L225 Difference]: With dead ends: 2052 [2022-07-23 04:15:13,092 INFO L226 Difference]: Without dead ends: 2050 [2022-07-23 04:15:13,094 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-23 04:15:13,095 INFO L413 NwaCegarLoop]: 2548 mSDtfsCounter, 4058 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2691 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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, 4.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:13,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4356 Valid, 4791 Invalid, 4713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2691 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-23 04:15:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2022-07-23 04:15:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2022-07-23 04:15:13,233 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-23 04:15:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2814 transitions. [2022-07-23 04:15:13,244 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2814 transitions. Word has length 133 [2022-07-23 04:15:13,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:13,244 INFO L495 AbstractCegarLoop]: Abstraction has 2050 states and 2814 transitions. [2022-07-23 04:15:13,245 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-23 04:15:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2814 transitions. [2022-07-23 04:15:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-23 04:15:13,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:13,247 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-23 04:15:13,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 04:15:13,247 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-23 04:15:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:13,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1489195741, now seen corresponding path program 1 times [2022-07-23 04:15:13,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:13,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915177555] [2022-07-23 04:15:13,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:13,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:13,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:15:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:15:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:15:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:15:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:15:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:15:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:15:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:15:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:15:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:15:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:13,671 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-23 04:15:13,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:13,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915177555] [2022-07-23 04:15:13,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915177555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:13,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:13,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:13,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38128835] [2022-07-23 04:15:13,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:13,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:13,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:13,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:13,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:13,673 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-23 04:15:18,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:18,201 INFO L93 Difference]: Finished difference Result 2050 states and 2814 transitions. [2022-07-23 04:15:18,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:18,202 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-23 04:15:18,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:18,209 INFO L225 Difference]: With dead ends: 2050 [2022-07-23 04:15:18,209 INFO L226 Difference]: Without dead ends: 2048 [2022-07-23 04:15:18,210 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-23 04:15:18,211 INFO L413 NwaCegarLoop]: 2546 mSDtfsCounter, 4052 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:18,211 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.3s Time] [2022-07-23 04:15:18,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2022-07-23 04:15:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2048. [2022-07-23 04:15:18,353 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-23 04:15:18,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2048 states to 2048 states and 2812 transitions. [2022-07-23 04:15:18,364 INFO L78 Accepts]: Start accepts. Automaton has 2048 states and 2812 transitions. Word has length 139 [2022-07-23 04:15:18,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:18,364 INFO L495 AbstractCegarLoop]: Abstraction has 2048 states and 2812 transitions. [2022-07-23 04:15:18,364 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-23 04:15:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2048 states and 2812 transitions. [2022-07-23 04:15:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-23 04:15:18,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:18,367 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-23 04:15:18,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 04:15:18,369 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-23 04:15:18,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:18,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1813546498, now seen corresponding path program 1 times [2022-07-23 04:15:18,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:18,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534066545] [2022-07-23 04:15:18,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:18,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:15:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:15:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:15:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:15:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:15:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:15:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:15:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-23 04:15:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:15:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-23 04:15:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:18,953 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-23 04:15:18,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:18,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534066545] [2022-07-23 04:15:18,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534066545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:18,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:18,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 04:15:18,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309439564] [2022-07-23 04:15:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:18,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:15:18,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:18,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:15:18,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:15:18,957 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-23 04:15:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:29,775 INFO L93 Difference]: Finished difference Result 4142 states and 5839 transitions. [2022-07-23 04:15:29,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 04:15:29,776 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-23 04:15:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:29,783 INFO L225 Difference]: With dead ends: 4142 [2022-07-23 04:15:29,783 INFO L226 Difference]: Without dead ends: 2160 [2022-07-23 04:15:29,790 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-23 04:15:29,791 INFO L413 NwaCegarLoop]: 2539 mSDtfsCounter, 4909 mSDsluCounter, 4489 mSDsCounter, 0 mSdLazyCounter, 7813 mSolverCounterSat, 2959 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s 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, 10.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:29,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5238 Valid, 7028 Invalid, 10772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2959 Valid, 7813 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2022-07-23 04:15:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2022-07-23 04:15:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2044. [2022-07-23 04:15:29,927 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-23 04:15:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2807 transitions. [2022-07-23 04:15:29,939 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2807 transitions. Word has length 182 [2022-07-23 04:15:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:29,940 INFO L495 AbstractCegarLoop]: Abstraction has 2044 states and 2807 transitions. [2022-07-23 04:15:29,940 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-23 04:15:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2807 transitions. [2022-07-23 04:15:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-23 04:15:29,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:29,942 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-23 04:15:29,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 04:15:29,943 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-23 04:15:29,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:29,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1191704634, now seen corresponding path program 1 times [2022-07-23 04:15:29,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:29,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618093672] [2022-07-23 04:15:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:29,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:15:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:15:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:15:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:15:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:15:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:15:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:15:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:15:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:15:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:15:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:15:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,338 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-23 04:15:30,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:30,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618093672] [2022-07-23 04:15:30,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618093672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:30,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:30,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152798633] [2022-07-23 04:15:30,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:30,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:30,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:30,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:30,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:30,341 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-23 04:15:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:35,399 INFO L93 Difference]: Finished difference Result 2044 states and 2807 transitions. [2022-07-23 04:15:35,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:35,400 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-23 04:15:35,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:35,410 INFO L225 Difference]: With dead ends: 2044 [2022-07-23 04:15:35,411 INFO L226 Difference]: Without dead ends: 2042 [2022-07-23 04:15:35,413 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-23 04:15:35,414 INFO L413 NwaCegarLoop]: 2541 mSDtfsCounter, 4037 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s 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, 4.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:35,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4333 Valid, 4784 Invalid, 4706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2684 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-23 04:15:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2022-07-23 04:15:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042. [2022-07-23 04:15:35,558 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-23 04:15:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 2805 transitions. [2022-07-23 04:15:35,568 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 2805 transitions. Word has length 145 [2022-07-23 04:15:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:35,569 INFO L495 AbstractCegarLoop]: Abstraction has 2042 states and 2805 transitions. [2022-07-23 04:15:35,569 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-23 04:15:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 2805 transitions. [2022-07-23 04:15:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-23 04:15:35,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:35,570 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-23 04:15:35,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-23 04:15:35,571 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-23 04:15:35,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:35,571 INFO L85 PathProgramCache]: Analyzing trace with hash -382114972, now seen corresponding path program 1 times [2022-07-23 04:15:35,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:35,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319905042] [2022-07-23 04:15:35,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:15:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:15:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:15:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:15:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:15:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:35,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:36,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:15:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:36,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:15:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:36,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:15:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:36,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-23 04:15:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:36,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:15:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:36,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:36,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:36,050 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-23 04:15:36,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:36,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319905042] [2022-07-23 04:15:36,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319905042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:36,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:36,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999491210] [2022-07-23 04:15:36,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:36,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:36,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:36,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:36,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:36,052 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-23 04:15:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:40,485 INFO L93 Difference]: Finished difference Result 4130 states and 5825 transitions. [2022-07-23 04:15:40,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:40,486 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-23 04:15:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:40,497 INFO L225 Difference]: With dead ends: 4130 [2022-07-23 04:15:40,498 INFO L226 Difference]: Without dead ends: 2154 [2022-07-23 04:15:40,510 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-23 04:15:40,511 INFO L413 NwaCegarLoop]: 2533 mSDtfsCounter, 4880 mSDsluCounter, 1923 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 2957 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5210 SdHoareTripleChecker+Valid, 4456 SdHoareTripleChecker+Invalid, 4878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2957 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:40,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5210 Valid, 4456 Invalid, 4878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2957 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-23 04:15:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-07-23 04:15:40,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 2038. [2022-07-23 04:15:40,658 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-23 04:15:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2800 transitions. [2022-07-23 04:15:40,669 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2800 transitions. Word has length 189 [2022-07-23 04:15:40,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:40,669 INFO L495 AbstractCegarLoop]: Abstraction has 2038 states and 2800 transitions. [2022-07-23 04:15:40,670 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-23 04:15:40,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2800 transitions. [2022-07-23 04:15:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-23 04:15:40,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:40,671 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-23 04:15:40,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 04:15:40,672 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-23 04:15:40,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:40,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1667725455, now seen corresponding path program 1 times [2022-07-23 04:15:40,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:40,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776077613] [2022-07-23 04:15:40,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:40,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:15:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:41,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:15:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:15:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:15:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:15:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:15:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:15:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:15:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:15:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:15:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:15:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:15:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:41,135 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-23 04:15:41,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:41,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776077613] [2022-07-23 04:15:41,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776077613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:41,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:41,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:41,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034013567] [2022-07-23 04:15:41,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:41,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:41,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:41,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:41,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:41,138 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-23 04:15:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:46,000 INFO L93 Difference]: Finished difference Result 2038 states and 2800 transitions. [2022-07-23 04:15:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:46,000 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-23 04:15:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:46,007 INFO L225 Difference]: With dead ends: 2038 [2022-07-23 04:15:46,008 INFO L226 Difference]: Without dead ends: 2036 [2022-07-23 04:15:46,009 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-23 04:15:46,009 INFO L413 NwaCegarLoop]: 2534 mSDtfsCounter, 4016 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2677 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:46,009 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.5s Time] [2022-07-23 04:15:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2022-07-23 04:15:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 2036. [2022-07-23 04:15:46,170 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-23 04:15:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 2798 transitions. [2022-07-23 04:15:46,180 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 2798 transitions. Word has length 151 [2022-07-23 04:15:46,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:46,181 INFO L495 AbstractCegarLoop]: Abstraction has 2036 states and 2798 transitions. [2022-07-23 04:15:46,181 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-23 04:15:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2798 transitions. [2022-07-23 04:15:46,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-23 04:15:46,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:46,183 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-23 04:15:46,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-23 04:15:46,184 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-23 04:15:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash 926045391, now seen corresponding path program 1 times [2022-07-23 04:15:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:46,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612863597] [2022-07-23 04:15:46,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:46,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:15:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:15:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:15:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:15:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:15:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:15:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:15:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:15:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:15:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:15:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:15:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:15:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:15:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:46,665 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-23 04:15:46,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:46,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612863597] [2022-07-23 04:15:46,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612863597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:46,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:46,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:46,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116351747] [2022-07-23 04:15:46,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:46,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:46,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:46,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:46,669 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-23 04:15:51,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:51,453 INFO L93 Difference]: Finished difference Result 2036 states and 2798 transitions. [2022-07-23 04:15:51,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:51,453 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-23 04:15:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:51,464 INFO L225 Difference]: With dead ends: 2036 [2022-07-23 04:15:51,464 INFO L226 Difference]: Without dead ends: 2034 [2022-07-23 04:15:51,467 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-23 04:15:51,467 INFO L413 NwaCegarLoop]: 2532 mSDtfsCounter, 4010 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2675 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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, 4.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:51,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4304 Valid, 4775 Invalid, 4697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2022 Valid, 2675 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-23 04:15:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2022-07-23 04:15:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 2034. [2022-07-23 04:15:51,668 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-23 04:15:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2796 transitions. [2022-07-23 04:15:51,679 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2796 transitions. Word has length 157 [2022-07-23 04:15:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:51,679 INFO L495 AbstractCegarLoop]: Abstraction has 2034 states and 2796 transitions. [2022-07-23 04:15:51,680 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-23 04:15:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2796 transitions. [2022-07-23 04:15:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-23 04:15:51,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:51,681 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-23 04:15:51,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 04:15:51,682 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-23 04:15:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:51,682 INFO L85 PathProgramCache]: Analyzing trace with hash 603295667, now seen corresponding path program 1 times [2022-07-23 04:15:51,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:51,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007423993] [2022-07-23 04:15:51,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:51,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:15:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:15:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:15:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:15:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:15:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:15:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:15:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:15:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:15:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:15:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:15:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:15:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:15:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:15:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,117 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-23 04:15:52,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:52,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007423993] [2022-07-23 04:15:52,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007423993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:52,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:52,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:52,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193981260] [2022-07-23 04:15:52,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:52,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:52,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:52,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:52,120 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-23 04:15:57,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:57,232 INFO L93 Difference]: Finished difference Result 2034 states and 2796 transitions. [2022-07-23 04:15:57,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:57,233 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-23 04:15:57,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:57,239 INFO L225 Difference]: With dead ends: 2034 [2022-07-23 04:15:57,240 INFO L226 Difference]: Without dead ends: 2032 [2022-07-23 04:15:57,240 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-23 04:15:57,241 INFO L413 NwaCegarLoop]: 2530 mSDtfsCounter, 4004 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2673 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:57,241 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.8s Time] [2022-07-23 04:15:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2022-07-23 04:15:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 2032. [2022-07-23 04:15:57,405 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-23 04:15:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 2794 transitions. [2022-07-23 04:15:57,415 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 2794 transitions. Word has length 163 [2022-07-23 04:15:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:57,416 INFO L495 AbstractCegarLoop]: Abstraction has 2032 states and 2794 transitions. [2022-07-23 04:15:57,416 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-23 04:15:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 2794 transitions. [2022-07-23 04:15:57,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-23 04:15:57,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:57,418 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-23 04:15:57,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-23 04:15:57,418 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-23 04:15:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2069826128, now seen corresponding path program 1 times [2022-07-23 04:15:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:57,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682936155] [2022-07-23 04:15:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:15:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:15:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:15:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:15:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:15:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:15:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:15:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:15:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:15:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:15:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:15:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:15:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:15:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:15:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:15:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:15:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:15:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:15:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:15:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:15:57,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:15:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,769 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-23 04:15:57,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:57,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682936155] [2022-07-23 04:15:57,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682936155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:57,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:57,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:15:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235640030] [2022-07-23 04:15:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:57,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:15:57,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:57,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:15:57,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:15:57,772 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-23 04:16:02,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:02,100 INFO L93 Difference]: Finished difference Result 2032 states and 2794 transitions. [2022-07-23 04:16:02,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:16:02,100 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-23 04:16:02,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:02,108 INFO L225 Difference]: With dead ends: 2032 [2022-07-23 04:16:02,109 INFO L226 Difference]: Without dead ends: 2030 [2022-07-23 04:16:02,111 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-23 04:16:02,112 INFO L413 NwaCegarLoop]: 2528 mSDtfsCounter, 3998 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2671 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:02,112 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.1s Time] [2022-07-23 04:16:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2022-07-23 04:16:02,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2030. [2022-07-23 04:16:02,276 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-23 04:16:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2792 transitions. [2022-07-23 04:16:02,285 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2792 transitions. Word has length 169 [2022-07-23 04:16:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:02,286 INFO L495 AbstractCegarLoop]: Abstraction has 2030 states and 2792 transitions. [2022-07-23 04:16:02,286 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-23 04:16:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2792 transitions. [2022-07-23 04:16:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-23 04:16:02,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:02,288 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-23 04:16:02,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-23 04:16:02,288 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-23 04:16:02,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:02,289 INFO L85 PathProgramCache]: Analyzing trace with hash 974720182, now seen corresponding path program 1 times [2022-07-23 04:16:02,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:02,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332112229] [2022-07-23 04:16:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:02,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:16:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:16:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:16:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:16:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:16:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:16:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:16:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:16:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:16:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:16:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:16:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:16:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:16:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:16:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:16:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:16:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:16:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:16:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:16:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:16:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:16:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:16:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:16:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 04:16:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,709 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-23 04:16:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:02,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332112229] [2022-07-23 04:16:02,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332112229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:02,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:02,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:16:02,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498043681] [2022-07-23 04:16:02,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:02,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:16:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:02,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:16:02,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:16:02,711 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-23 04:16:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:12,820 INFO L93 Difference]: Finished difference Result 3994 states and 5530 transitions. [2022-07-23 04:16:12,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:16:12,821 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-23 04:16:12,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:12,841 INFO L225 Difference]: With dead ends: 3994 [2022-07-23 04:16:12,842 INFO L226 Difference]: Without dead ends: 3992 [2022-07-23 04:16:12,845 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-23 04:16:12,846 INFO L413 NwaCegarLoop]: 3100 mSDtfsCounter, 5606 mSDsluCounter, 3163 mSDsCounter, 0 mSdLazyCounter, 6135 mSolverCounterSat, 3474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s 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-23 04:16:12,846 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-23 04:16:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3992 states. [2022-07-23 04:16:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3992 to 3967. [2022-07-23 04:16:13,197 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-23 04:16:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3967 states to 3967 states and 5506 transitions. [2022-07-23 04:16:13,225 INFO L78 Accepts]: Start accepts. Automaton has 3967 states and 5506 transitions. Word has length 175 [2022-07-23 04:16:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:13,226 INFO L495 AbstractCegarLoop]: Abstraction has 3967 states and 5506 transitions. [2022-07-23 04:16:13,226 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-23 04:16:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3967 states and 5506 transitions. [2022-07-23 04:16:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-23 04:16:13,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:13,229 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-23 04:16:13,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-23 04:16:13,229 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-23 04:16:13,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2125406338, now seen corresponding path program 1 times [2022-07-23 04:16:13,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:13,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201185540] [2022-07-23 04:16:13,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:13,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:16:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:16:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:16:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:16:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:16:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:16:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:16:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:16:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:16:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:16:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:16:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:16:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:16:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:16:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:16:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:16:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:16:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:16:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:16:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:16:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:16:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:16:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:16:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 04:16:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:16:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:13,658 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-23 04:16:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:13,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201185540] [2022-07-23 04:16:13,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201185540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:13,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:13,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:16:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608407906] [2022-07-23 04:16:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:13,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:16:13,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:13,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:16:13,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:16:13,661 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-23 04:16:18,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:18,791 INFO L93 Difference]: Finished difference Result 3967 states and 5506 transitions. [2022-07-23 04:16:18,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:16:18,792 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-23 04:16:18,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:18,806 INFO L225 Difference]: With dead ends: 3967 [2022-07-23 04:16:18,807 INFO L226 Difference]: Without dead ends: 3965 [2022-07-23 04:16:18,809 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-23 04:16:18,810 INFO L413 NwaCegarLoop]: 2526 mSDtfsCounter, 3992 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 2022 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:18,810 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.7s Time] [2022-07-23 04:16:18,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3965 states. [2022-07-23 04:16:19,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3965 to 3965. [2022-07-23 04:16:19,153 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-23 04:16:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 5504 transitions. [2022-07-23 04:16:19,175 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 5504 transitions. Word has length 181 [2022-07-23 04:16:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:19,175 INFO L495 AbstractCegarLoop]: Abstraction has 3965 states and 5504 transitions. [2022-07-23 04:16:19,176 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-23 04:16:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 5504 transitions. [2022-07-23 04:16:19,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-07-23 04:16:19,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:19,178 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-23 04:16:19,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-23 04:16:19,179 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-23 04:16:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:19,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1696326244, now seen corresponding path program 1 times [2022-07-23 04:16:19,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:19,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83177749] [2022-07-23 04:16:19,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:19,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:19,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:16:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:16:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-23 04:16:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-23 04:16:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:16:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:16:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:16:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:16:19,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-23 04:16:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:16:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:16:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 04:16:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:16:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-23 04:16:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-23 04:16:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:16:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:16:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 04:16:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-23 04:16:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:19,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:19,903 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-23 04:16:19,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:19,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83177749] [2022-07-23 04:16:19,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83177749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:19,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:19,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 04:16:19,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171145790] [2022-07-23 04:16:19,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:19,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 04:16:19,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:19,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 04:16:19,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:16:19,906 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-23 04:16:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:31,399 INFO L93 Difference]: Finished difference Result 4454 states and 6317 transitions. [2022-07-23 04:16:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 04:16:31,399 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-23 04:16:31,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:31,414 INFO L225 Difference]: With dead ends: 4454 [2022-07-23 04:16:31,414 INFO L226 Difference]: Without dead ends: 4452 [2022-07-23 04:16:31,417 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-23 04:16:31,417 INFO L413 NwaCegarLoop]: 2125 mSDtfsCounter, 6739 mSDsluCounter, 4489 mSDsCounter, 0 mSdLazyCounter, 6918 mSolverCounterSat, 5030 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7025 SdHoareTripleChecker+Valid, 6614 SdHoareTripleChecker+Invalid, 11948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5030 IncrementalHoareTripleChecker+Valid, 6918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:31,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7025 Valid, 6614 Invalid, 11948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5030 Valid, 6918 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-07-23 04:16:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2022-07-23 04:16:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 4058. [2022-07-23 04:16:31,782 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-23 04:16:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4058 states to 4058 states and 5636 transitions. [2022-07-23 04:16:31,805 INFO L78 Accepts]: Start accepts. Automaton has 4058 states and 5636 transitions. Word has length 231 [2022-07-23 04:16:31,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:31,806 INFO L495 AbstractCegarLoop]: Abstraction has 4058 states and 5636 transitions. [2022-07-23 04:16:31,806 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-23 04:16:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 4058 states and 5636 transitions. [2022-07-23 04:16:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-23 04:16:31,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:31,808 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-23 04:16:31,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-23 04:16:31,809 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-23 04:16:31,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:31,810 INFO L85 PathProgramCache]: Analyzing trace with hash 194067149, now seen corresponding path program 1 times [2022-07-23 04:16:31,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:31,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954200252] [2022-07-23 04:16:31,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:31,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:16:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-23 04:16:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:16:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-23 04:16:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-23 04:16:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:16:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-23 04:16:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:16:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:16:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-23 04:16:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-23 04:16:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:16:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:16:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:16:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:16:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:16:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-23 04:16:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:16:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:16:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:16:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:16:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:16:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:16:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 04:16:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:16:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-23 04:16:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:32,269 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-23 04:16:32,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:32,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954200252] [2022-07-23 04:16:32,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954200252] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:32,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:32,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:16:32,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102010474] [2022-07-23 04:16:32,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:32,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:16:32,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:32,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:16:32,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:16:32,272 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)