./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--elants_i2c.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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--elants_i2c.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 c80eb64b2f9217863d1cee53bd309527a1698bb6d7dac474881d4795c24080c8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 15:29:22,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:29:22,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:29:22,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:29:22,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:29:22,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:29:22,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:29:22,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:29:22,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:29:22,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:29:22,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:29:22,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:29:22,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:29:22,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:29:22,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:29:22,466 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:29:22,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:29:22,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:29:22,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:29:22,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:29:22,473 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:29:22,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:29:22,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:29:22,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:29:22,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:29:22,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:29:22,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:29:22,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:29:22,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:29:22,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:29:22,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:29:22,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:29:22,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:29:22,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:29:22,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:29:22,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:29:22,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:29:22,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:29:22,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:29:22,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:29:22,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:29:22,489 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:29:22,496 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:29:22,519 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:29:22,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:29:22,520 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:29:22,520 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:29:22,521 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:29:22,521 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:29:22,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:29:22,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:29:22,522 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:29:22,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:29:22,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:29:22,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:29:22,530 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:29:22,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:29:22,530 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:29:22,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:29:22,531 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:29:22,531 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:29:22,531 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:29:22,531 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:29:22,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:29:22,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:29:22,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:29:22,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:29:22,532 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:29:22,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:29:22,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:29:22,533 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:29:22,533 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:29:22,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:29:22,533 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 -> c80eb64b2f9217863d1cee53bd309527a1698bb6d7dac474881d4795c24080c8 [2022-07-21 15:29:22,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:29:22,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:29:22,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:29:22,802 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:29:22,803 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:29:22,804 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--elants_i2c.ko.cil.i [2022-07-21 15:29:22,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ce456f2/5236873b039f456fb8127fec864b6919/FLAG59420d4e4 [2022-07-21 15:29:23,453 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:29:23,454 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--elants_i2c.ko.cil.i [2022-07-21 15:29:23,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ce456f2/5236873b039f456fb8127fec864b6919/FLAG59420d4e4 [2022-07-21 15:29:23,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ce456f2/5236873b039f456fb8127fec864b6919 [2022-07-21 15:29:23,628 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:29:23,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:29:23,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:29:23,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:29:23,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:29:23,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:29:23" (1/1) ... [2022-07-21 15:29:23,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b6e6fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:23, skipping insertion in model container [2022-07-21 15:29:23,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:29:23" (1/1) ... [2022-07-21 15:29:23,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:29:23,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:29:25,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301233,301246] [2022-07-21 15:29:25,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301378,301391] [2022-07-21 15:29:25,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301524,301537] [2022-07-21 15:29:25,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301689,301702] [2022-07-21 15:29:25,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[301847,301860] [2022-07-21 15:29:25,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302005,302018] [2022-07-21 15:29:25,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302163,302176] [2022-07-21 15:29:25,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302323,302336] [2022-07-21 15:29:25,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302482,302495] [2022-07-21 15:29:25,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302621,302634] [2022-07-21 15:29:25,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302763,302776] [2022-07-21 15:29:25,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[302912,302925] [2022-07-21 15:29:25,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303051,303064] [2022-07-21 15:29:25,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303206,303219] [2022-07-21 15:29:25,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303366,303379] [2022-07-21 15:29:25,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303517,303530] [2022-07-21 15:29:25,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303668,303681] [2022-07-21 15:29:25,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303820,303833] [2022-07-21 15:29:25,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303969,303982] [2022-07-21 15:29:25,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304117,304130] [2022-07-21 15:29:25,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304274,304287] [2022-07-21 15:29:25,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304423,304436] [2022-07-21 15:29:25,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304579,304592] [2022-07-21 15:29:25,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304732,304745] [2022-07-21 15:29:25,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304878,304891] [2022-07-21 15:29:25,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305021,305034] [2022-07-21 15:29:25,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305173,305186] [2022-07-21 15:29:25,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305319,305332] [2022-07-21 15:29:25,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305464,305477] [2022-07-21 15:29:25,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305618,305631] [2022-07-21 15:29:25,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305769,305782] [2022-07-21 15:29:25,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305924,305937] [2022-07-21 15:29:25,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306076,306089] [2022-07-21 15:29:25,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306231,306244] [2022-07-21 15:29:25,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306395,306408] [2022-07-21 15:29:25,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306551,306564] [2022-07-21 15:29:25,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306715,306728] [2022-07-21 15:29:25,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306857,306870] [2022-07-21 15:29:25,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307015,307028] [2022-07-21 15:29:25,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307182,307195] [2022-07-21 15:29:25,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307341,307354] [2022-07-21 15:29:25,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307500,307513] [2022-07-21 15:29:25,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307649,307662] [2022-07-21 15:29:25,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307796,307809] [2022-07-21 15:29:25,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307935,307948] [2022-07-21 15:29:25,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308098,308111] [2022-07-21 15:29:25,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308264,308277] [2022-07-21 15:29:25,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308428,308441] [2022-07-21 15:29:25,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308593,308606] [2022-07-21 15:29:25,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308758,308771] [2022-07-21 15:29:25,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308924,308937] [2022-07-21 15:29:25,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309089,309102] [2022-07-21 15:29:25,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309256,309269] [2022-07-21 15:29:25,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309416,309429] [2022-07-21 15:29:25,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309578,309591] [2022-07-21 15:29:25,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309737,309750] [2022-07-21 15:29:25,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309883,309896] [2022-07-21 15:29:25,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310026,310039] [2022-07-21 15:29:25,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310170,310183] [2022-07-21 15:29:25,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310313,310326] [2022-07-21 15:29:25,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310457,310470] [2022-07-21 15:29:25,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310598,310611] [2022-07-21 15:29:25,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310736,310749] [2022-07-21 15:29:25,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310894,310907] [2022-07-21 15:29:25,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311053,311066] [2022-07-21 15:29:25,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311209,311222] [2022-07-21 15:29:25,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311358,311371] [2022-07-21 15:29:25,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311510,311523] [2022-07-21 15:29:25,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311661,311674] [2022-07-21 15:29:25,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311810,311823] [2022-07-21 15:29:25,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311962,311975] [2022-07-21 15:29:25,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312110,312123] [2022-07-21 15:29:25,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312263,312276] [2022-07-21 15:29:25,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312414,312427] [2022-07-21 15:29:25,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312564,312577] [2022-07-21 15:29:25,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312711,312724] [2022-07-21 15:29:25,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312862,312875] [2022-07-21 15:29:25,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313013,313026] [2022-07-21 15:29:25,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313161,313174] [2022-07-21 15:29:25,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313327,313340] [2022-07-21 15:29:25,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313496,313509] [2022-07-21 15:29:25,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313663,313676] [2022-07-21 15:29:25,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313831,313844] [2022-07-21 15:29:25,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313981,313994] [2022-07-21 15:29:25,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314128,314141] [2022-07-21 15:29:25,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314289,314302] [2022-07-21 15:29:25,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314459,314472] [2022-07-21 15:29:25,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314621,314634] [2022-07-21 15:29:25,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:29:25,371 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[301233,301246] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[301378,301391] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[301524,301537] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[301689,301702] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[301847,301860] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[302005,302018] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[302163,302176] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[302323,302336] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[302482,302495] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[302621,302634] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[302763,302776] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[302912,302925] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[303051,303064] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[303206,303219] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[303366,303379] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[303517,303530] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[303668,303681] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[303820,303833] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[303969,303982] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[304117,304130] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[304274,304287] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[304423,304436] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[304579,304592] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[304732,304745] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[304878,304891] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[305021,305034] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[305173,305186] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[305319,305332] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[305464,305477] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[305618,305631] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[305769,305782] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[305924,305937] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[306076,306089] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[306231,306244] [2022-07-21 15:29:25,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306395,306408] [2022-07-21 15:29:25,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306551,306564] [2022-07-21 15:29:25,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306715,306728] [2022-07-21 15:29:25,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306857,306870] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[307015,307028] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[307182,307195] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[307341,307354] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[307500,307513] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[307649,307662] [2022-07-21 15:29:25,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307796,307809] [2022-07-21 15:29:25,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307935,307948] [2022-07-21 15:29:25,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308098,308111] [2022-07-21 15:29:25,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308264,308277] [2022-07-21 15:29:25,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308428,308441] [2022-07-21 15:29:25,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308593,308606] [2022-07-21 15:29:25,606 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308758,308771] [2022-07-21 15:29:25,607 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308924,308937] [2022-07-21 15:29:25,607 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309089,309102] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[309256,309269] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[309416,309429] [2022-07-21 15:29:25,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--elants_i2c.ko.cil.i[309578,309591] [2022-07-21 15:29:25,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309737,309750] [2022-07-21 15:29:25,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309883,309896] [2022-07-21 15:29:25,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310026,310039] [2022-07-21 15:29:25,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310170,310183] [2022-07-21 15:29:25,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310313,310326] [2022-07-21 15:29:25,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310457,310470] [2022-07-21 15:29:25,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310598,310611] [2022-07-21 15:29:25,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310736,310749] [2022-07-21 15:29:25,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310894,310907] [2022-07-21 15:29:25,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311053,311066] [2022-07-21 15:29:25,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311209,311222] [2022-07-21 15:29:25,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311358,311371] [2022-07-21 15:29:25,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311510,311523] [2022-07-21 15:29:25,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311661,311674] [2022-07-21 15:29:25,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311810,311823] [2022-07-21 15:29:25,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311962,311975] [2022-07-21 15:29:25,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312110,312123] [2022-07-21 15:29:25,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312263,312276] [2022-07-21 15:29:25,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312414,312427] [2022-07-21 15:29:25,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312564,312577] [2022-07-21 15:29:25,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312711,312724] [2022-07-21 15:29:25,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312862,312875] [2022-07-21 15:29:25,655 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313013,313026] [2022-07-21 15:29:25,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313161,313174] [2022-07-21 15:29:25,656 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313327,313340] [2022-07-21 15:29:25,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313496,313509] [2022-07-21 15:29:25,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313663,313676] [2022-07-21 15:29:25,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313831,313844] [2022-07-21 15:29:25,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313981,313994] [2022-07-21 15:29:25,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314128,314141] [2022-07-21 15:29:25,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314289,314302] [2022-07-21 15:29:25,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314459,314472] [2022-07-21 15:29:25,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314621,314634] [2022-07-21 15:29:25,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:29:25,833 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:29:25,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:25 WrapperNode [2022-07-21 15:29:25,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:29:25,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:29:25,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:29:25,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:29:25,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:25" (1/1) ... [2022-07-21 15:29:25,931 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:25" (1/1) ... [2022-07-21 15:29:26,054 INFO L137 Inliner]: procedures = 537, calls = 1891, calls flagged for inlining = 255, calls inlined = 172, statements flattened = 4095 [2022-07-21 15:29:26,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:29:26,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:29:26,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:29:26,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:29:26,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:25" (1/1) ... [2022-07-21 15:29:26,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:25" (1/1) ... [2022-07-21 15:29:26,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:25" (1/1) ... [2022-07-21 15:29:26,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:25" (1/1) ... [2022-07-21 15:29:26,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:25" (1/1) ... [2022-07-21 15:29:26,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:25" (1/1) ... [2022-07-21 15:29:26,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:25" (1/1) ... [2022-07-21 15:29:26,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:29:26,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:29:26,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:29:26,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:29:26,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:25" (1/1) ... [2022-07-21 15:29:26,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:29:26,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:29:26,276 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-21 15:29:26,294 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-21 15:29:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-21 15:29:26,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-21 15:29:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:29:26,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:29:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:29:26,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:29:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:29:26,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:29:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:29:26,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:29:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:29:26,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:29:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_parse_version [2022-07-21 15:29:26,306 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_parse_version [2022-07-21 15:29:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-07-21 15:29:26,306 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-07-21 15:29:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-21 15:29:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:29:26,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:29:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_remove_sysfs_group [2022-07-21 15:29:26,307 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_remove_sysfs_group [2022-07-21 15:29:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:29:26,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:29:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:29:26,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:29:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:29:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:29:26,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:29:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_set_res [2022-07-21 15:29:26,308 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_set_res [2022-07-21 15:29:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure write_update_fw [2022-07-21 15:29:26,308 INFO L138 BoogieDeclarations]: Found implementation of procedure write_update_fw [2022-07-21 15:29:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 15:29:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 15:29:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:29:26,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:29:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:29:26,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:29:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:29:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:29:26,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:29:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_get_clientdata [2022-07-21 15:29:26,309 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_get_clientdata [2022-07-21 15:29:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:29:26,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:29:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_suspend [2022-07-21 15:29:26,309 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_suspend [2022-07-21 15:29:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:29:26,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:29:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:29:26,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:29:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:29:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:29:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:29:26,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:29:26,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:29:26,311 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:29:26,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:29:26,311 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:29:26,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:29:26,311 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_master_recv [2022-07-21 15:29:26,311 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_master_recv [2022-07-21 15:29:26,311 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:29:26,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:29:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_send [2022-07-21 15:29:26,312 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_send [2022-07-21 15:29:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:29:26,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:29:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-21 15:29:26,312 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-21 15:29:26,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 15:29:26,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 15:29:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:29:26,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:29:26,315 INFO L130 BoogieDeclarations]: Found specification of procedure elants_version_attribute_show [2022-07-21 15:29:26,316 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_version_attribute_show [2022-07-21 15:29:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure disable_irq [2022-07-21 15:29:26,316 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_irq [2022-07-21 15:29:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_sw_reset [2022-07-21 15:29:26,316 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_sw_reset [2022-07-21 15:29:26,316 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:29:26,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:29:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_calibrate [2022-07-21 15:29:26,320 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_calibrate [2022-07-21 15:29:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:29:26,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:29:26,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:29:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:29:26,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:29:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:29:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-21 15:29:26,321 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-21 15:29:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:29:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_resume [2022-07-21 15:29:26,321 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_resume [2022-07-21 15:29:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure calibrate_store [2022-07-21 15:29:26,321 INFO L138 BoogieDeclarations]: Found implementation of procedure calibrate_store [2022-07-21 15:29:26,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:29:26,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:29:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:29:26,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:29:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:29:26,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:29:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:29:26,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:29:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:29:26,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:29:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2022-07-21 15:29:26,323 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2022-07-21 15:29:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2022-07-21 15:29:26,325 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2022-07-21 15:29:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:29:26,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:29:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:29:26,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:29:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:29:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:29:26,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:29:26,326 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_initialize [2022-07-21 15:29:26,326 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_initialize [2022-07-21 15:29:26,326 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 15:29:26,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 15:29:26,326 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_sysfs_mutex_of_elants_data [2022-07-21 15:29:26,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_sysfs_mutex_of_elants_data [2022-07-21 15:29:26,327 INFO L130 BoogieDeclarations]: Found specification of procedure enable_irq [2022-07-21 15:29:26,327 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_irq [2022-07-21 15:29:26,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:29:26,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:29:26,327 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-21 15:29:26,327 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-21 15:29:26,327 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_read [2022-07-21 15:29:26,327 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_read [2022-07-21 15:29:26,327 INFO L130 BoogieDeclarations]: Found specification of procedure __set_bit [2022-07-21 15:29:26,327 INFO L138 BoogieDeclarations]: Found implementation of procedure __set_bit [2022-07-21 15:29:26,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sysfs_mutex_of_elants_data [2022-07-21 15:29:26,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sysfs_mutex_of_elants_data [2022-07-21 15:29:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2022-07-21 15:29:26,328 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2022-07-21 15:29:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_execute_command [2022-07-21 15:29:26,328 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_execute_command [2022-07-21 15:29:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 15:29:26,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 15:29:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:29:26,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:29:26,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:29:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_event [2022-07-21 15:29:26,329 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_event [2022-07-21 15:29:26,791 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:29:26,792 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:29:26,875 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:29:36,448 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:29:36,457 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:29:36,457 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 15:29:36,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:29:36 BoogieIcfgContainer [2022-07-21 15:29:36,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:29:36,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:29:36,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:29:36,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:29:36,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:29:23" (1/3) ... [2022-07-21 15:29:36,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a99d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:29:36, skipping insertion in model container [2022-07-21 15:29:36,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:29:25" (2/3) ... [2022-07-21 15:29:36,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38a99d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:29:36, skipping insertion in model container [2022-07-21 15:29:36,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:29:36" (3/3) ... [2022-07-21 15:29:36,467 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i [2022-07-21 15:29:36,476 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:29:36,476 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-21 15:29:36,517 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:29:36,521 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@73665dad, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1e66e15b [2022-07-21 15:29:36,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-21 15:29:36,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 1160 states, 798 states have (on average 1.299498746867168) internal successors, (1037), 843 states have internal predecessors, (1037), 270 states have call successors, (270), 65 states have call predecessors, (270), 64 states have return successors, (265), 265 states have call predecessors, (265), 265 states have call successors, (265) [2022-07-21 15:29:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 15:29:36,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:29:36,534 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:29:36,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:29:36,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:29:36,537 INFO L85 PathProgramCache]: Analyzing trace with hash 397725343, now seen corresponding path program 1 times [2022-07-21 15:29:36,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:29:36,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275310358] [2022-07-21 15:29:36,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:29:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:29:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:37,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:29:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:37,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:29:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:37,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:29:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:37,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:29:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:37,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:29:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:37,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:29:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:37,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:29:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:37,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:29:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:37,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:29:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:29:37,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:29:37,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275310358] [2022-07-21 15:29:37,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275310358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:29:37,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:29:37,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:29:37,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380555404] [2022-07-21 15:29:37,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:29:37,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:29:37,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:29:37,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:29:37,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:29:37,133 INFO L87 Difference]: Start difference. First operand has 1160 states, 798 states have (on average 1.299498746867168) internal successors, (1037), 843 states have internal predecessors, (1037), 270 states have call successors, (270), 65 states have call predecessors, (270), 64 states have return successors, (265), 265 states have call predecessors, (265), 265 states have call successors, (265) Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 15:29:39,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:29:41,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:29:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:29:44,327 INFO L93 Difference]: Finished difference Result 2289 states and 3162 transitions. [2022-07-21 15:29:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:29:44,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2022-07-21 15:29:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:29:44,349 INFO L225 Difference]: With dead ends: 2289 [2022-07-21 15:29:44,350 INFO L226 Difference]: Without dead ends: 1142 [2022-07-21 15:29:44,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 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-21 15:29:44,361 INFO L413 NwaCegarLoop]: 1441 mSDtfsCounter, 2301 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 914 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2464 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:29:44,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2464 Valid, 2901 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 1373 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-21 15:29:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-07-21 15:29:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2022-07-21 15:29:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 788 states have (on average 1.2576142131979695) internal successors, (991), 828 states have internal predecessors, (991), 265 states have call successors, (265), 64 states have call predecessors, (265), 63 states have return successors, (263), 263 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-21 15:29:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1519 transitions. [2022-07-21 15:29:44,473 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1519 transitions. Word has length 64 [2022-07-21 15:29:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:29:44,475 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1519 transitions. [2022-07-21 15:29:44,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 15:29:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1519 transitions. [2022-07-21 15:29:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-21 15:29:44,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:29:44,480 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:29:44,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:29:44,480 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:29:44,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:29:44,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1378894902, now seen corresponding path program 1 times [2022-07-21 15:29:44,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:29:44,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856130591] [2022-07-21 15:29:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:29:44,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:29:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:44,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:29:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:44,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:29:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:44,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:29:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:44,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:29:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:44,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:29:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:44,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:29:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:44,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:29:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:44,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:29:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:44,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:29:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:29:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:29:44,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:29:44,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856130591] [2022-07-21 15:29:44,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856130591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:29:44,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:29:44,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:29:44,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635006437] [2022-07-21 15:29:44,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:29:44,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:29:44,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:29:44,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:29:44,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:29:44,674 INFO L87 Difference]: Start difference. First operand 1142 states and 1519 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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-21 15:29:46,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:29:48,715 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:29:53,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 15:29:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:29:54,242 INFO L93 Difference]: Finished difference Result 1142 states and 1519 transitions. [2022-07-21 15:29:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:29:54,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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 70 [2022-07-21 15:29:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:29:54,249 INFO L225 Difference]: With dead ends: 1142 [2022-07-21 15:29:54,249 INFO L226 Difference]: Without dead ends: 1140 [2022-07-21 15:29:54,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 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-21 15:29:54,250 INFO L413 NwaCegarLoop]: 1421 mSDtfsCounter, 2267 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2427 SdHoareTripleChecker+Valid, 2861 SdHoareTripleChecker+Invalid, 2265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:29:54,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2427 Valid, 2861 Invalid, 2265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1358 Invalid, 3 Unknown, 0 Unchecked, 9.4s Time] [2022-07-21 15:29:54,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-07-21 15:29:54,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2022-07-21 15:29:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 787 states have (on average 1.2566709021601017) internal successors, (989), 826 states have internal predecessors, (989), 265 states have call successors, (265), 64 states have call predecessors, (265), 63 states have return successors, (263), 263 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-21 15:29:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1517 transitions. [2022-07-21 15:29:54,289 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1517 transitions. Word has length 70 [2022-07-21 15:29:54,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:29:54,290 INFO L495 AbstractCegarLoop]: Abstraction has 1140 states and 1517 transitions. [2022-07-21 15:29:54,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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-21 15:29:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1517 transitions. [2022-07-21 15:29:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-21 15:29:54,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:29:54,292 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:29:54,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:29:54,292 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:29:54,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:29:54,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1387426283, now seen corresponding path program 1 times [2022-07-21 15:29:54,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:29:54,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585203097] [2022-07-21 15:29:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:29:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:29:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:54,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:29:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:54,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:29:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:54,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:29:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:54,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:29:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:54,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:29:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:54,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:29:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:54,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:29:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:54,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:29:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:54,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:29:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:54,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:29:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:54,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:29:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:29:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:29:54,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:29:54,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585203097] [2022-07-21 15:29:54,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585203097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:29:54,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:29:54,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:29:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692303366] [2022-07-21 15:29:54,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:29:54,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:29:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:29:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:29:54,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:29:54,526 INFO L87 Difference]: Start difference. First operand 1140 states and 1517 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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-21 15:29:56,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:29:58,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:02,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-21 15:30:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:30:03,373 INFO L93 Difference]: Finished difference Result 1140 states and 1517 transitions. [2022-07-21 15:30:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:30:03,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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 76 [2022-07-21 15:30:03,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:30:03,378 INFO L225 Difference]: With dead ends: 1140 [2022-07-21 15:30:03,378 INFO L226 Difference]: Without dead ends: 1138 [2022-07-21 15:30:03,378 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-21 15:30:03,379 INFO L413 NwaCegarLoop]: 1419 mSDtfsCounter, 2261 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 2859 SdHoareTripleChecker+Invalid, 2263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:30:03,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2420 Valid, 2859 Invalid, 2263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1356 Invalid, 3 Unknown, 0 Unchecked, 8.7s Time] [2022-07-21 15:30:03,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-07-21 15:30:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2022-07-21 15:30:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 786 states have (on average 1.2557251908396947) internal successors, (987), 824 states have internal predecessors, (987), 265 states have call successors, (265), 64 states have call predecessors, (265), 63 states have return successors, (263), 263 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-21 15:30:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1515 transitions. [2022-07-21 15:30:03,426 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1515 transitions. Word has length 76 [2022-07-21 15:30:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:30:03,426 INFO L495 AbstractCegarLoop]: Abstraction has 1138 states and 1515 transitions. [2022-07-21 15:30:03,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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-21 15:30:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1515 transitions. [2022-07-21 15:30:03,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-21 15:30:03,428 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:30:03,429 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:30:03,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 15:30:03,429 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:30:03,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:30:03,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1256211171, now seen corresponding path program 1 times [2022-07-21 15:30:03,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:30:03,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010875165] [2022-07-21 15:30:03,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:30:03,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:30:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:30:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:30:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:30:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:30:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:30:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:30:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:30:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:30:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:30:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:30:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:30:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:30:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:30:03,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:30:03,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010875165] [2022-07-21 15:30:03,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010875165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:30:03,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:30:03,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:30:03,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299292139] [2022-07-21 15:30:03,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:30:03,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:30:03,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:30:03,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:30:03,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:30:03,615 INFO L87 Difference]: Start difference. First operand 1138 states and 1515 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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-21 15:30:05,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:07,652 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:30:10,538 INFO L93 Difference]: Finished difference Result 1138 states and 1515 transitions. [2022-07-21 15:30:10,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:30:10,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 82 [2022-07-21 15:30:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:30:10,544 INFO L225 Difference]: With dead ends: 1138 [2022-07-21 15:30:10,544 INFO L226 Difference]: Without dead ends: 1136 [2022-07-21 15:30:10,545 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-21 15:30:10,545 INFO L413 NwaCegarLoop]: 1417 mSDtfsCounter, 2255 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 2857 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:30:10,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 2857 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1355 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-07-21 15:30:10,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2022-07-21 15:30:10,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1136. [2022-07-21 15:30:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 785 states have (on average 1.2547770700636942) internal successors, (985), 822 states have internal predecessors, (985), 265 states have call successors, (265), 64 states have call predecessors, (265), 63 states have return successors, (263), 263 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-21 15:30:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1513 transitions. [2022-07-21 15:30:10,576 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1513 transitions. Word has length 82 [2022-07-21 15:30:10,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:30:10,577 INFO L495 AbstractCegarLoop]: Abstraction has 1136 states and 1513 transitions. [2022-07-21 15:30:10,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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-21 15:30:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1513 transitions. [2022-07-21 15:30:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-21 15:30:10,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:30:10,578 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:30:10,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 15:30:10,579 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:30:10,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:30:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1973731712, now seen corresponding path program 1 times [2022-07-21 15:30:10,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:30:10,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371362467] [2022-07-21 15:30:10,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:30:10,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:30:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:30:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:30:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:30:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:30:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:30:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:30:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:30:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:30:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:30:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:30:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:30:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:30:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:30:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:30:10,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:30:10,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371362467] [2022-07-21 15:30:10,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371362467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:30:10,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:30:10,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:30:10,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948160102] [2022-07-21 15:30:10,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:30:10,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:30:10,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:30:10,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:30:10,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:30:10,762 INFO L87 Difference]: Start difference. First operand 1136 states and 1513 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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-21 15:30:12,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:14,808 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:30:17,760 INFO L93 Difference]: Finished difference Result 1136 states and 1513 transitions. [2022-07-21 15:30:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:30:17,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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 88 [2022-07-21 15:30:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:30:17,766 INFO L225 Difference]: With dead ends: 1136 [2022-07-21 15:30:17,766 INFO L226 Difference]: Without dead ends: 1134 [2022-07-21 15:30:17,767 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-21 15:30:17,768 INFO L413 NwaCegarLoop]: 1415 mSDtfsCounter, 2249 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:30:17,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 2855 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1353 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-21 15:30:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-07-21 15:30:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1134. [2022-07-21 15:30:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 784 states have (on average 1.253826530612245) internal successors, (983), 820 states have internal predecessors, (983), 265 states have call successors, (265), 64 states have call predecessors, (265), 63 states have return successors, (263), 263 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-21 15:30:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1511 transitions. [2022-07-21 15:30:17,800 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1511 transitions. Word has length 88 [2022-07-21 15:30:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:30:17,801 INFO L495 AbstractCegarLoop]: Abstraction has 1134 states and 1511 transitions. [2022-07-21 15:30:17,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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-21 15:30:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1511 transitions. [2022-07-21 15:30:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 15:30:17,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:30:17,806 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:30:17,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 15:30:17,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:30:17,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:30:17,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1678572572, now seen corresponding path program 1 times [2022-07-21 15:30:17,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:30:17,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715159336] [2022-07-21 15:30:17,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:30:17,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:30:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:30:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:30:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:30:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:30:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:30:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:30:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:30:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:30:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:30:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:30:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:30:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:30:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:30:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:30:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:30:17,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:30:17,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715159336] [2022-07-21 15:30:17,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715159336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:30:17,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:30:17,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:30:17,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852623676] [2022-07-21 15:30:17,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:30:17,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:30:17,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:30:17,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:30:17,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:30:17,997 INFO L87 Difference]: Start difference. First operand 1134 states and 1511 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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-21 15:30:20,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:22,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:30:25,109 INFO L93 Difference]: Finished difference Result 1134 states and 1511 transitions. [2022-07-21 15:30:25,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:30:25,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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 94 [2022-07-21 15:30:25,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:30:25,114 INFO L225 Difference]: With dead ends: 1134 [2022-07-21 15:30:25,115 INFO L226 Difference]: Without dead ends: 1132 [2022-07-21 15:30:25,115 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-21 15:30:25,116 INFO L413 NwaCegarLoop]: 1413 mSDtfsCounter, 2243 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 2853 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:30:25,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 2853 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1351 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-07-21 15:30:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2022-07-21 15:30:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2022-07-21 15:30:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 783 states have (on average 1.2528735632183907) internal successors, (981), 818 states have internal predecessors, (981), 265 states have call successors, (265), 64 states have call predecessors, (265), 63 states have return successors, (263), 263 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-21 15:30:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1509 transitions. [2022-07-21 15:30:25,149 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1509 transitions. Word has length 94 [2022-07-21 15:30:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:30:25,149 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1509 transitions. [2022-07-21 15:30:25,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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-21 15:30:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1509 transitions. [2022-07-21 15:30:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 15:30:25,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:30:25,151 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:30:25,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 15:30:25,151 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:30:25,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:30:25,152 INFO L85 PathProgramCache]: Analyzing trace with hash 955210123, now seen corresponding path program 1 times [2022-07-21 15:30:25,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:30:25,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077856597] [2022-07-21 15:30:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:30:25,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:30:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:30:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:30:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:30:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:30:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:30:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:30:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:30:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:30:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:30:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:30:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:30:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:30:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:30:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:30:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:30:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:30:25,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:30:25,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077856597] [2022-07-21 15:30:25,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077856597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:30:25,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:30:25,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:30:25,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365222856] [2022-07-21 15:30:25,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:30:25,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:30:25,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:30:25,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:30:25,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:30:25,317 INFO L87 Difference]: Start difference. First operand 1132 states and 1509 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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-21 15:30:27,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:29,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:33,429 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:37,522 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:39,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:30:39,550 INFO L93 Difference]: Finished difference Result 2235 states and 2981 transitions. [2022-07-21 15:30:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 15:30:39,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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 100 [2022-07-21 15:30:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:30:39,561 INFO L225 Difference]: With dead ends: 2235 [2022-07-21 15:30:39,561 INFO L226 Difference]: Without dead ends: 2233 [2022-07-21 15:30:39,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:30:39,563 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 3329 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 1608 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3482 SdHoareTripleChecker+Valid, 3580 SdHoareTripleChecker+Invalid, 4550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1608 IncrementalHoareTripleChecker+Valid, 2938 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:30:39,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3482 Valid, 3580 Invalid, 4550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1608 Valid, 2938 Invalid, 4 Unknown, 0 Unchecked, 14.0s Time] [2022-07-21 15:30:39,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2022-07-21 15:30:39,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2096. [2022-07-21 15:30:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2096 states, 1470 states have (on average 1.2578231292517006) internal successors, (1849), 1520 states have internal predecessors, (1849), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-21 15:30:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 2833 transitions. [2022-07-21 15:30:39,634 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 2833 transitions. Word has length 100 [2022-07-21 15:30:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:30:39,634 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 2833 transitions. [2022-07-21 15:30:39,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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-21 15:30:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2833 transitions. [2022-07-21 15:30:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 15:30:39,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:30:39,636 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:30:39,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 15:30:39,636 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:30:39,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:30:39,637 INFO L85 PathProgramCache]: Analyzing trace with hash 474370401, now seen corresponding path program 1 times [2022-07-21 15:30:39,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:30:39,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859926623] [2022-07-21 15:30:39,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:30:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:30:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:30:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:30:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:30:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:30:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:30:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:30:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:30:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:30:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:30:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:30:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:30:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:30:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:30:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:30:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:30:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:30:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:30:39,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:30:39,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859926623] [2022-07-21 15:30:39,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859926623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:30:39,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:30:39,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:30:39,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056901033] [2022-07-21 15:30:39,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:30:39,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:30:39,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:30:39,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:30:39,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:30:39,819 INFO L87 Difference]: Start difference. First operand 2096 states and 2833 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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-21 15:30:41,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:43,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:46,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:30:46,709 INFO L93 Difference]: Finished difference Result 2096 states and 2833 transitions. [2022-07-21 15:30:46,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:30:46,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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 106 [2022-07-21 15:30:46,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:30:46,719 INFO L225 Difference]: With dead ends: 2096 [2022-07-21 15:30:46,719 INFO L226 Difference]: Without dead ends: 2094 [2022-07-21 15:30:46,720 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-21 15:30:46,721 INFO L413 NwaCegarLoop]: 1411 mSDtfsCounter, 2241 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 2851 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:30:46,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 2851 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1345 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-07-21 15:30:46,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2022-07-21 15:30:46,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2094. [2022-07-21 15:30:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2094 states, 1469 states have (on average 1.2573179033356026) internal successors, (1847), 1518 states have internal predecessors, (1847), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-21 15:30:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 2831 transitions. [2022-07-21 15:30:46,784 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 2831 transitions. Word has length 106 [2022-07-21 15:30:46,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:30:46,785 INFO L495 AbstractCegarLoop]: Abstraction has 2094 states and 2831 transitions. [2022-07-21 15:30:46,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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-21 15:30:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2831 transitions. [2022-07-21 15:30:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-21 15:30:46,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:30:46,786 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:30:46,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 15:30:46,787 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:30:46,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:30:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash 603557956, now seen corresponding path program 1 times [2022-07-21 15:30:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:30:46,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902685477] [2022-07-21 15:30:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:30:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:30:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:30:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:30:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:30:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:30:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:30:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:30:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:30:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:30:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:30:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:30:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:30:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:30:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:30:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:30:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:30:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:30:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:46,956 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:30:46,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:30:46,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902685477] [2022-07-21 15:30:46,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902685477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:30:46,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:30:46,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:30:46,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536198228] [2022-07-21 15:30:46,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:30:46,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:30:46,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:30:46,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:30:46,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:30:46,958 INFO L87 Difference]: Start difference. First operand 2094 states and 2831 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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-21 15:30:48,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:51,000 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:30:53,959 INFO L93 Difference]: Finished difference Result 2094 states and 2831 transitions. [2022-07-21 15:30:53,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:30:53,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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 108 [2022-07-21 15:30:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:30:53,967 INFO L225 Difference]: With dead ends: 2094 [2022-07-21 15:30:53,967 INFO L226 Difference]: Without dead ends: 2092 [2022-07-21 15:30:53,968 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-21 15:30:53,969 INFO L413 NwaCegarLoop]: 1409 mSDtfsCounter, 2229 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2383 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:30:53,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2383 Valid, 2849 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1347 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-21 15:30:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2022-07-21 15:30:54,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 2092. [2022-07-21 15:30:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2092 states, 1468 states have (on average 1.2568119891008174) internal successors, (1845), 1516 states have internal predecessors, (1845), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-21 15:30:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2829 transitions. [2022-07-21 15:30:54,031 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2829 transitions. Word has length 108 [2022-07-21 15:30:54,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:30:54,031 INFO L495 AbstractCegarLoop]: Abstraction has 2092 states and 2829 transitions. [2022-07-21 15:30:54,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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-21 15:30:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2829 transitions. [2022-07-21 15:30:54,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-21 15:30:54,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:30:54,033 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:30:54,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 15:30:54,033 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:30:54,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:30:54,034 INFO L85 PathProgramCache]: Analyzing trace with hash -998949483, now seen corresponding path program 1 times [2022-07-21 15:30:54,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:30:54,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202290161] [2022-07-21 15:30:54,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:30:54,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:30:54,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:30:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:30:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:30:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:30:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:30:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:30:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:30:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:30:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:30:54,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 15:30:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:30:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:30:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:30:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:30:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:30:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:30:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:30:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:30:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:30:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:30:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:30:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:30:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-21 15:30:54,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:30:54,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202290161] [2022-07-21 15:30:54,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202290161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:30:54,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:30:54,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:30:54,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484924315] [2022-07-21 15:30:54,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:30:54,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:30:54,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:30:54,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:30:54,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:30:54,261 INFO L87 Difference]: Start difference. First operand 2092 states and 2829 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:30:56,281 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:30:58,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:00,322 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:04,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:05,455 INFO L93 Difference]: Finished difference Result 3620 states and 4844 transitions. [2022-07-21 15:31:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 15:31:05,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2022-07-21 15:31:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:05,464 INFO L225 Difference]: With dead ends: 3620 [2022-07-21 15:31:05,464 INFO L226 Difference]: Without dead ends: 2098 [2022-07-21 15:31:05,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:31:05,469 INFO L413 NwaCegarLoop]: 1225 mSDtfsCounter, 2454 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 1216 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 2415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1216 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:05,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2625 Valid, 2463 Invalid, 2415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1216 Valid, 1195 Invalid, 4 Unknown, 0 Unchecked, 11.1s Time] [2022-07-21 15:31:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2022-07-21 15:31:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2086. [2022-07-21 15:31:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 1463 states have (on average 1.2549555707450444) internal successors, (1836), 1510 states have internal predecessors, (1836), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-21 15:31:05,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 2820 transitions. [2022-07-21 15:31:05,536 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 2820 transitions. Word has length 129 [2022-07-21 15:31:05,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:05,537 INFO L495 AbstractCegarLoop]: Abstraction has 2086 states and 2820 transitions. [2022-07-21 15:31:05,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (18), 4 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:31:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2820 transitions. [2022-07-21 15:31:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-21 15:31:05,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:05,538 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:05,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 15:31:05,539 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:31:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:05,539 INFO L85 PathProgramCache]: Analyzing trace with hash -576112153, now seen corresponding path program 1 times [2022-07-21 15:31:05,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:05,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808747846] [2022-07-21 15:31:05,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:05,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:31:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:31:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:31:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:31:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:31:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:31:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:31:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:31:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:31:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:31:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:31:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:31:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:31:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:31:05,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:31:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:31:05,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:05,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808747846] [2022-07-21 15:31:05,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808747846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:05,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:05,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:05,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100807031] [2022-07-21 15:31:05,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:05,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:05,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:05,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:05,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:05,690 INFO L87 Difference]: Start difference. First operand 2086 states and 2820 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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-21 15:31:07,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:09,734 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:13,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:14,677 INFO L93 Difference]: Finished difference Result 2086 states and 2820 transitions. [2022-07-21 15:31:14,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:14,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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 114 [2022-07-21 15:31:14,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:14,696 INFO L225 Difference]: With dead ends: 2086 [2022-07-21 15:31:14,696 INFO L226 Difference]: Without dead ends: 2084 [2022-07-21 15:31:14,697 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-21 15:31:14,697 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 2220 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2373 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:14,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2373 Valid, 2828 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1343 Invalid, 3 Unknown, 0 Unchecked, 8.8s Time] [2022-07-21 15:31:14,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2022-07-21 15:31:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2084. [2022-07-21 15:31:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1462 states have (on average 1.2544459644322845) internal successors, (1834), 1508 states have internal predecessors, (1834), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-21 15:31:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2818 transitions. [2022-07-21 15:31:14,781 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2818 transitions. Word has length 114 [2022-07-21 15:31:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:14,783 INFO L495 AbstractCegarLoop]: Abstraction has 2084 states and 2818 transitions. [2022-07-21 15:31:14,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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-21 15:31:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2818 transitions. [2022-07-21 15:31:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-21 15:31:14,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:14,785 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:14,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 15:31:14,785 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:31:14,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash -227467516, now seen corresponding path program 1 times [2022-07-21 15:31:14,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:14,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514621231] [2022-07-21 15:31:14,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:14,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:31:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:31:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:31:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:31:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:31:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:31:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:31:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 15:31:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:31:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:31:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:31:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:31:14,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:31:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:31:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:31:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-21 15:31:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:14,995 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2022-07-21 15:31:14,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:14,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514621231] [2022-07-21 15:31:14,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514621231] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:31:14,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20973258] [2022-07-21 15:31:14,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:14,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:31:14,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:31:14,998 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-21 15:31:15,002 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-21 15:31:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:15,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 2216 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 15:31:15,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:31:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-21 15:31:15,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:31:15,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20973258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:15,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:31:15,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-21 15:31:15,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638192130] [2022-07-21 15:31:15,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:15,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:31:15,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:15,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:31:15,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:31:15,708 INFO L87 Difference]: Start difference. First operand 2084 states and 2818 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:31:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:15,803 INFO L93 Difference]: Finished difference Result 3592 states and 4804 transitions. [2022-07-21 15:31:15,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:31:15,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 135 [2022-07-21 15:31:15,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:15,812 INFO L225 Difference]: With dead ends: 3592 [2022-07-21 15:31:15,813 INFO L226 Difference]: Without dead ends: 2078 [2022-07-21 15:31:15,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:31:15,818 INFO L413 NwaCegarLoop]: 1492 mSDtfsCounter, 1478 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:15,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1492 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:31:15,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2022-07-21 15:31:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2078. [2022-07-21 15:31:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 1457 states have (on average 1.2525737817433082) internal successors, (1825), 1502 states have internal predecessors, (1825), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-21 15:31:15,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2809 transitions. [2022-07-21 15:31:15,905 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2809 transitions. Word has length 135 [2022-07-21 15:31:15,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:15,906 INFO L495 AbstractCegarLoop]: Abstraction has 2078 states and 2809 transitions. [2022-07-21 15:31:15,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:31:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2809 transitions. [2022-07-21 15:31:15,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-21 15:31:15,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:15,908 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:15,933 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-21 15:31:16,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-21 15:31:16,123 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:31:16,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:16,124 INFO L85 PathProgramCache]: Analyzing trace with hash 920618242, now seen corresponding path program 1 times [2022-07-21 15:31:16,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:16,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540650854] [2022-07-21 15:31:16,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:16,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:31:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:31:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:31:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:31:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:31:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:31:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:31:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:31:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:31:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:31:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:31:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:31:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:31:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:31:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:31:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:31:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:31:16,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:16,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540650854] [2022-07-21 15:31:16,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540650854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:16,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:16,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:16,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614466420] [2022-07-21 15:31:16,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:16,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:16,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:16,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:16,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:16,339 INFO L87 Difference]: Start difference. First operand 2078 states and 2809 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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-21 15:31:18,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:20,379 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:24,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:25,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:25,704 INFO L93 Difference]: Finished difference Result 2078 states and 2809 transitions. [2022-07-21 15:31:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:25,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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 120 [2022-07-21 15:31:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:25,711 INFO L225 Difference]: With dead ends: 2078 [2022-07-21 15:31:25,711 INFO L226 Difference]: Without dead ends: 2076 [2022-07-21 15:31:25,712 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-21 15:31:25,712 INFO L413 NwaCegarLoop]: 1395 mSDtfsCounter, 2209 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 2247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:25,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 2807 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1340 Invalid, 3 Unknown, 0 Unchecked, 9.2s Time] [2022-07-21 15:31:25,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2022-07-21 15:31:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2076. [2022-07-21 15:31:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2076 states, 1456 states have (on average 1.2520604395604396) internal successors, (1823), 1500 states have internal predecessors, (1823), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-21 15:31:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2807 transitions. [2022-07-21 15:31:25,784 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2807 transitions. Word has length 120 [2022-07-21 15:31:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:25,785 INFO L495 AbstractCegarLoop]: Abstraction has 2076 states and 2807 transitions. [2022-07-21 15:31:25,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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-21 15:31:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2807 transitions. [2022-07-21 15:31:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-21 15:31:25,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:25,787 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:25,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 15:31:25,787 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:31:25,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:25,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1966366827, now seen corresponding path program 1 times [2022-07-21 15:31:25,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:25,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500419357] [2022-07-21 15:31:25,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:25,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:31:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:31:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:31:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:31:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:31:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:31:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:31:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:31:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:31:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:31:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:31:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:31:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:31:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:31:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:31:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:31:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:31:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:31:25,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:25,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500419357] [2022-07-21 15:31:25,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500419357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:25,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:25,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:25,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380276056] [2022-07-21 15:31:25,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:25,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:25,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:25,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:25,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:25,957 INFO L87 Difference]: Start difference. First operand 2076 states and 2807 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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-21 15:31:27,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:29,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:33,285 INFO L93 Difference]: Finished difference Result 2076 states and 2807 transitions. [2022-07-21 15:31:33,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:33,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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 126 [2022-07-21 15:31:33,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:33,294 INFO L225 Difference]: With dead ends: 2076 [2022-07-21 15:31:33,294 INFO L226 Difference]: Without dead ends: 2074 [2022-07-21 15:31:33,295 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-21 15:31:33,296 INFO L413 NwaCegarLoop]: 1393 mSDtfsCounter, 2203 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 2805 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:33,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2354 Valid, 2805 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1339 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-07-21 15:31:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2022-07-21 15:31:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2022-07-21 15:31:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 1455 states have (on average 1.2515463917525773) internal successors, (1821), 1498 states have internal predecessors, (1821), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-21 15:31:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2805 transitions. [2022-07-21 15:31:33,376 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2805 transitions. Word has length 126 [2022-07-21 15:31:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:33,376 INFO L495 AbstractCegarLoop]: Abstraction has 2074 states and 2805 transitions. [2022-07-21 15:31:33,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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-21 15:31:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2805 transitions. [2022-07-21 15:31:33,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-21 15:31:33,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:33,379 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:33,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 15:31:33,379 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:31:33,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:33,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1374776284, now seen corresponding path program 1 times [2022-07-21 15:31:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:33,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519399497] [2022-07-21 15:31:33,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:33,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:31:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:31:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:31:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:31:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:31:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:31:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:31:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:31:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:31:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:31:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:31:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:31:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:31:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:31:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:31:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:31:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:31:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:31:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:31:33,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:33,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519399497] [2022-07-21 15:31:33,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519399497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:33,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:33,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:33,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446975436] [2022-07-21 15:31:33,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:33,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:33,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:33,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:33,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:33,591 INFO L87 Difference]: Start difference. First operand 2074 states and 2805 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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-21 15:31:35,612 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:37,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:40,548 INFO L93 Difference]: Finished difference Result 2074 states and 2805 transitions. [2022-07-21 15:31:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:40,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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 132 [2022-07-21 15:31:40,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:40,556 INFO L225 Difference]: With dead ends: 2074 [2022-07-21 15:31:40,556 INFO L226 Difference]: Without dead ends: 2072 [2022-07-21 15:31:40,556 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-21 15:31:40,557 INFO L413 NwaCegarLoop]: 1391 mSDtfsCounter, 2197 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:40,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2347 Valid, 2803 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1337 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-07-21 15:31:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2022-07-21 15:31:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 2072. [2022-07-21 15:31:40,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 1454 states have (on average 1.251031636863824) internal successors, (1819), 1496 states have internal predecessors, (1819), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-21 15:31:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2803 transitions. [2022-07-21 15:31:40,631 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2803 transitions. Word has length 132 [2022-07-21 15:31:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:40,631 INFO L495 AbstractCegarLoop]: Abstraction has 2072 states and 2803 transitions. [2022-07-21 15:31:40,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 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-21 15:31:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2803 transitions. [2022-07-21 15:31:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-21 15:31:40,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:40,634 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:40,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 15:31:40,634 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:31:40,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:40,635 INFO L85 PathProgramCache]: Analyzing trace with hash 311265212, now seen corresponding path program 1 times [2022-07-21 15:31:40,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:40,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319624282] [2022-07-21 15:31:40,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:40,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:31:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:31:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:31:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:31:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:31:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:31:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:31:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:31:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:31:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:31:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:31:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:31:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:31:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:31:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:31:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:31:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:31:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:31:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:31:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:40,804 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:31:40,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:40,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319624282] [2022-07-21 15:31:40,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319624282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:40,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:40,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:40,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475941874] [2022-07-21 15:31:40,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:40,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:40,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:40,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:40,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:40,806 INFO L87 Difference]: Start difference. First operand 2072 states and 2803 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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-21 15:31:42,827 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:44,849 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:48,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:50,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:51,161 INFO L93 Difference]: Finished difference Result 2072 states and 2803 transitions. [2022-07-21 15:31:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:51,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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 138 [2022-07-21 15:31:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:51,170 INFO L225 Difference]: With dead ends: 2072 [2022-07-21 15:31:51,170 INFO L226 Difference]: Without dead ends: 2070 [2022-07-21 15:31:51,172 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-21 15:31:51,172 INFO L413 NwaCegarLoop]: 1389 mSDtfsCounter, 2191 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2340 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:51,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2340 Valid, 2801 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1334 Invalid, 3 Unknown, 0 Unchecked, 10.2s Time] [2022-07-21 15:31:51,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2022-07-21 15:31:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2070. [2022-07-21 15:31:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2070 states, 1453 states have (on average 1.250516173434274) internal successors, (1817), 1494 states have internal predecessors, (1817), 493 states have call successors, (493), 113 states have call predecessors, (493), 112 states have return successors, (491), 489 states have call predecessors, (491), 491 states have call successors, (491) [2022-07-21 15:31:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2801 transitions. [2022-07-21 15:31:51,255 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2801 transitions. Word has length 138 [2022-07-21 15:31:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:51,255 INFO L495 AbstractCegarLoop]: Abstraction has 2070 states and 2801 transitions. [2022-07-21 15:31:51,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 4 states have internal predecessors, (84), 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-21 15:31:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2801 transitions. [2022-07-21 15:31:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-21 15:31:51,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:51,258 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 15:31:51,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 15:31:51,258 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:31:51,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:51,259 INFO L85 PathProgramCache]: Analyzing trace with hash 86212839, now seen corresponding path program 1 times [2022-07-21 15:31:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:51,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50152921] [2022-07-21 15:31:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:31:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:31:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:31:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:31:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:31:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:31:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:31:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 15:31:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:31:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:31:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:31:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 15:31:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:31:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 15:31:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 15:31:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:31:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 15:31:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:31:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:31:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 15:31:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:51,616 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2022-07-21 15:31:51,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:51,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50152921] [2022-07-21 15:31:51,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50152921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:51,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:51,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:31:51,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349180136] [2022-07-21 15:31:51,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:51,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:31:51,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:51,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:31:51,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:31:51,620 INFO L87 Difference]: Start difference. First operand 2070 states and 2801 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:31:53,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:55,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:31:57,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:09,782 INFO L93 Difference]: Finished difference Result 3069 states and 4118 transitions. [2022-07-21 15:32:09,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 15:32:09,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 183 [2022-07-21 15:32:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:09,793 INFO L225 Difference]: With dead ends: 3069 [2022-07-21 15:32:09,793 INFO L226 Difference]: Without dead ends: 3067 [2022-07-21 15:32:09,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-07-21 15:32:09,795 INFO L413 NwaCegarLoop]: 1590 mSDtfsCounter, 3107 mSDsluCounter, 2566 mSDsCounter, 0 mSdLazyCounter, 4318 mSolverCounterSat, 1596 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3260 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 5917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1596 IncrementalHoareTripleChecker+Valid, 4318 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:09,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3260 Valid, 4156 Invalid, 5917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1596 Valid, 4318 Invalid, 3 Unknown, 0 Unchecked, 17.8s Time] [2022-07-21 15:32:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2022-07-21 15:32:09,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 3010. [2022-07-21 15:32:09,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 2115 states have (on average 1.2501182033096927) internal successors, (2644), 2174 states have internal predecessors, (2644), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-21 15:32:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 4056 transitions. [2022-07-21 15:32:09,940 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 4056 transitions. Word has length 183 [2022-07-21 15:32:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:09,940 INFO L495 AbstractCegarLoop]: Abstraction has 3010 states and 4056 transitions. [2022-07-21 15:32:09,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:32:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 4056 transitions. [2022-07-21 15:32:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-21 15:32:09,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:09,943 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:09,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 15:32:09,943 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:32:09,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash 268626821, now seen corresponding path program 1 times [2022-07-21 15:32:09,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:09,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618692673] [2022-07-21 15:32:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:09,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:32:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:32:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:32:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:32:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:32:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:32:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:32:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:32:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:32:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:32:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:32:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:32:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:32:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:32:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:32:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:32:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:32:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:32:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:32:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:32:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:32:10,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:10,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618692673] [2022-07-21 15:32:10,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618692673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:10,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:10,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:10,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694651635] [2022-07-21 15:32:10,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:10,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:10,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:10,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:10,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:10,152 INFO L87 Difference]: Start difference. First operand 3010 states and 4056 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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-21 15:32:12,172 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:14,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:18,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:19,416 INFO L93 Difference]: Finished difference Result 3010 states and 4056 transitions. [2022-07-21 15:32:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:19,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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 144 [2022-07-21 15:32:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:19,428 INFO L225 Difference]: With dead ends: 3010 [2022-07-21 15:32:19,428 INFO L226 Difference]: Without dead ends: 3008 [2022-07-21 15:32:19,429 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-21 15:32:19,430 INFO L413 NwaCegarLoop]: 1387 mSDtfsCounter, 2185 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2333 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:19,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2333 Valid, 2799 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1332 Invalid, 3 Unknown, 0 Unchecked, 9.1s Time] [2022-07-21 15:32:19,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2022-07-21 15:32:19,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2022-07-21 15:32:19,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 2114 states have (on average 1.249290444654683) internal successors, (2641), 2172 states have internal predecessors, (2641), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-21 15:32:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4053 transitions. [2022-07-21 15:32:19,595 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4053 transitions. Word has length 144 [2022-07-21 15:32:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:19,595 INFO L495 AbstractCegarLoop]: Abstraction has 3008 states and 4053 transitions. [2022-07-21 15:32:19,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 4 states have internal predecessors, (88), 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-21 15:32:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4053 transitions. [2022-07-21 15:32:19,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-21 15:32:19,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:19,598 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:19,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 15:32:19,598 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:32:19,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:19,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1181738883, now seen corresponding path program 1 times [2022-07-21 15:32:19,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:19,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756225686] [2022-07-21 15:32:19,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:19,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:32:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:32:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:32:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:32:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:32:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:32:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:32:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:32:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:32:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:32:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:32:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:32:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:32:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:32:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:32:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:32:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:32:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:32:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:32:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:32:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:32:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:32:19,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:19,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756225686] [2022-07-21 15:32:19,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756225686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:19,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:19,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:19,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153207654] [2022-07-21 15:32:19,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:19,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:19,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:19,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:19,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:19,775 INFO L87 Difference]: Start difference. First operand 3008 states and 4053 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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-21 15:32:21,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:23,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:27,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-21 15:32:29,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:30,990 INFO L93 Difference]: Finished difference Result 3008 states and 4053 transitions. [2022-07-21 15:32:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:30,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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 150 [2022-07-21 15:32:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:30,998 INFO L225 Difference]: With dead ends: 3008 [2022-07-21 15:32:30,998 INFO L226 Difference]: Without dead ends: 3006 [2022-07-21 15:32:30,999 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-21 15:32:30,999 INFO L413 NwaCegarLoop]: 1385 mSDtfsCounter, 2179 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 904 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 2797 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:30,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 2797 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1329 Invalid, 4 Unknown, 0 Unchecked, 11.0s Time] [2022-07-21 15:32:31,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2022-07-21 15:32:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 3006. [2022-07-21 15:32:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3006 states, 2113 states have (on average 1.2484619025082822) internal successors, (2638), 2170 states have internal predecessors, (2638), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-21 15:32:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 4050 transitions. [2022-07-21 15:32:31,155 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 4050 transitions. Word has length 150 [2022-07-21 15:32:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:31,156 INFO L495 AbstractCegarLoop]: Abstraction has 3006 states and 4050 transitions. [2022-07-21 15:32:31,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 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-21 15:32:31,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 4050 transitions. [2022-07-21 15:32:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-21 15:32:31,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:31,159 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 15:32:31,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 15:32:31,159 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:32:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:31,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1422462914, now seen corresponding path program 1 times [2022-07-21 15:32:31,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:31,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452518705] [2022-07-21 15:32:31,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:31,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:32:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:32:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:32:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:32:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:32:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:32:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:32:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:32:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:32:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:32:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:32:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:32:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:32:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:32:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:32:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:32:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:32:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:32:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:32:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:32:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:32:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:32:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:32:31,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:31,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452518705] [2022-07-21 15:32:31,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452518705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:31,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:31,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:31,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983856430] [2022-07-21 15:32:31,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:31,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:31,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:31,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:31,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:31,334 INFO L87 Difference]: Start difference. First operand 3006 states and 4050 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 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-21 15:32:33,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:35,394 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:39,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:40,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:40,931 INFO L93 Difference]: Finished difference Result 3006 states and 4050 transitions. [2022-07-21 15:32:40,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:40,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 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 156 [2022-07-21 15:32:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:40,941 INFO L225 Difference]: With dead ends: 3006 [2022-07-21 15:32:40,941 INFO L226 Difference]: Without dead ends: 3004 [2022-07-21 15:32:40,942 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-21 15:32:40,943 INFO L413 NwaCegarLoop]: 1383 mSDtfsCounter, 2173 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:40,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 2795 Invalid, 2235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1328 Invalid, 3 Unknown, 0 Unchecked, 9.4s Time] [2022-07-21 15:32:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2022-07-21 15:32:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 3004. [2022-07-21 15:32:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 2112 states have (on average 1.2476325757575757) internal successors, (2635), 2168 states have internal predecessors, (2635), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-21 15:32:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 4047 transitions. [2022-07-21 15:32:41,107 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 4047 transitions. Word has length 156 [2022-07-21 15:32:41,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:41,107 INFO L495 AbstractCegarLoop]: Abstraction has 3004 states and 4047 transitions. [2022-07-21 15:32:41,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 4 states have internal predecessors, (96), 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-21 15:32:41,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 4047 transitions. [2022-07-21 15:32:41,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-21 15:32:41,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:41,111 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 15:32:41,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 15:32:41,111 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:32:41,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash -274649241, now seen corresponding path program 1 times [2022-07-21 15:32:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:41,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081972435] [2022-07-21 15:32:41,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:32:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:32:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:32:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:32:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:32:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:32:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:32:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:32:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:32:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:32:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:32:41,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:32:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:32:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:32:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:32:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:32:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:32:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:32:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:32:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:32:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:32:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:32:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:32:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:32:41,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:41,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081972435] [2022-07-21 15:32:41,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081972435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:41,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:41,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:41,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887718061] [2022-07-21 15:32:41,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:41,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:41,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:41,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:41,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:41,296 INFO L87 Difference]: Start difference. First operand 3004 states and 4047 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 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-21 15:32:43,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:45,340 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:49,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:50,661 INFO L93 Difference]: Finished difference Result 3004 states and 4047 transitions. [2022-07-21 15:32:50,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:50,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 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 162 [2022-07-21 15:32:50,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:50,668 INFO L225 Difference]: With dead ends: 3004 [2022-07-21 15:32:50,668 INFO L226 Difference]: Without dead ends: 3002 [2022-07-21 15:32:50,669 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-21 15:32:50,670 INFO L413 NwaCegarLoop]: 1381 mSDtfsCounter, 2167 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:50,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2312 Valid, 2793 Invalid, 2233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1326 Invalid, 3 Unknown, 0 Unchecked, 9.2s Time] [2022-07-21 15:32:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2022-07-21 15:32:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 3002. [2022-07-21 15:32:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2111 states have (on average 1.2468024632875414) internal successors, (2632), 2166 states have internal predecessors, (2632), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-21 15:32:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 4044 transitions. [2022-07-21 15:32:50,819 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 4044 transitions. Word has length 162 [2022-07-21 15:32:50,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:50,819 INFO L495 AbstractCegarLoop]: Abstraction has 3002 states and 4044 transitions. [2022-07-21 15:32:50,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 4 states have internal predecessors, (100), 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-21 15:32:50,819 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 4044 transitions. [2022-07-21 15:32:50,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-21 15:32:50,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:50,822 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 15:32:50,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 15:32:50,822 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:32:50,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:50,823 INFO L85 PathProgramCache]: Analyzing trace with hash -862924115, now seen corresponding path program 1 times [2022-07-21 15:32:50,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:50,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801944806] [2022-07-21 15:32:50,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:50,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:32:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:32:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:32:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:32:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:32:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:32:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:32:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:32:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:32:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:32:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:32:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:32:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:32:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:32:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:32:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:32:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:32:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:32:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:32:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:32:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:32:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:32:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:32:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:32:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:32:50,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:50,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801944806] [2022-07-21 15:32:50,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801944806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:50,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:50,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:50,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446667820] [2022-07-21 15:32:50,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:50,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:50,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:50,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:50,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:50,990 INFO L87 Difference]: Start difference. First operand 3002 states and 4044 transitions. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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-21 15:32:53,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:55,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:32:57,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:57,700 INFO L93 Difference]: Finished difference Result 3002 states and 4044 transitions. [2022-07-21 15:32:57,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:57,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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 168 [2022-07-21 15:32:57,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:57,708 INFO L225 Difference]: With dead ends: 3002 [2022-07-21 15:32:57,708 INFO L226 Difference]: Without dead ends: 3000 [2022-07-21 15:32:57,710 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-21 15:32:57,710 INFO L413 NwaCegarLoop]: 1379 mSDtfsCounter, 2161 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2305 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:57,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2305 Valid, 2791 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1325 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-07-21 15:32:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2022-07-21 15:32:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 3000. [2022-07-21 15:32:57,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3000 states, 2110 states have (on average 1.2459715639810427) internal successors, (2629), 2164 states have internal predecessors, (2629), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-21 15:32:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 4041 transitions. [2022-07-21 15:32:57,883 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 4041 transitions. Word has length 168 [2022-07-21 15:32:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:57,884 INFO L495 AbstractCegarLoop]: Abstraction has 3000 states and 4041 transitions. [2022-07-21 15:32:57,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 4 states have internal predecessors, (104), 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-21 15:32:57,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 4041 transitions. [2022-07-21 15:32:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-21 15:32:57,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:57,888 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 15:32:57,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 15:32:57,888 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:32:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1586344965, now seen corresponding path program 1 times [2022-07-21 15:32:57,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:57,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326510927] [2022-07-21 15:32:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:57,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:57,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:57,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:32:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:32:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:32:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:32:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:32:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:32:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:32:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:32:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:32:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:32:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:32:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:32:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:32:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:32:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:32:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:32:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:32:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:32:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:32:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:32:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:32:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:32:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:32:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:32:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:32:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:32:58,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:58,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326510927] [2022-07-21 15:32:58,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326510927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:58,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:58,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:58,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619617049] [2022-07-21 15:32:58,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:58,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:58,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:58,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:58,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:58,101 INFO L87 Difference]: Start difference. First operand 3000 states and 4041 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 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-21 15:33:00,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:33:02,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:33:06,727 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:33:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:33:06,852 INFO L93 Difference]: Finished difference Result 3000 states and 4041 transitions. [2022-07-21 15:33:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:33:06,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 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 174 [2022-07-21 15:33:06,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:33:06,861 INFO L225 Difference]: With dead ends: 3000 [2022-07-21 15:33:06,861 INFO L226 Difference]: Without dead ends: 2998 [2022-07-21 15:33:06,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 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-21 15:33:06,863 INFO L413 NwaCegarLoop]: 1377 mSDtfsCounter, 2155 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 2789 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:33:06,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 2789 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1322 Invalid, 3 Unknown, 0 Unchecked, 8.5s Time] [2022-07-21 15:33:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-07-21 15:33:07,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2998. [2022-07-21 15:33:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2998 states, 2109 states have (on average 1.245139876718824) internal successors, (2626), 2162 states have internal predecessors, (2626), 695 states have call successors, (695), 187 states have call predecessors, (695), 188 states have return successors, (717), 685 states have call predecessors, (717), 693 states have call successors, (717) [2022-07-21 15:33:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 4038 transitions. [2022-07-21 15:33:07,036 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 4038 transitions. Word has length 174 [2022-07-21 15:33:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:33:07,037 INFO L495 AbstractCegarLoop]: Abstraction has 2998 states and 4038 transitions. [2022-07-21 15:33:07,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 4 states have internal predecessors, (108), 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-21 15:33:07,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 4038 transitions. [2022-07-21 15:33:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-21 15:33:07,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:33:07,041 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 15:33:07,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 15:33:07,041 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:33:07,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:33:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash 870548665, now seen corresponding path program 1 times [2022-07-21 15:33:07,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:33:07,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717210889] [2022-07-21 15:33:07,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:33:07,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:33:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:33:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:33:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:33:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:33:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:33:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:33:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:33:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:33:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 15:33:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:33:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:33:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:33:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 15:33:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 15:33:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:33:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:33:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-21 15:33:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:33:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:33:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:33:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:33:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:33:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 15:33:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-21 15:33:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 15:33:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:33:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 15:33:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-21 15:33:07,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:33:07,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717210889] [2022-07-21 15:33:07,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717210889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:33:07,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:33:07,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:33:07,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419778230] [2022-07-21 15:33:07,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:33:07,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:33:07,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:33:07,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:33:07,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:33:07,249 INFO L87 Difference]: Start difference. First operand 2998 states and 4038 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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-21 15:33:09,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:33:11,303 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:33:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:33:14,062 INFO L93 Difference]: Finished difference Result 2998 states and 4038 transitions. [2022-07-21 15:33:14,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:33:14,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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 180 [2022-07-21 15:33:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:33:14,072 INFO L225 Difference]: With dead ends: 2998 [2022-07-21 15:33:14,072 INFO L226 Difference]: Without dead ends: 2715 [2022-07-21 15:33:14,076 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-21 15:33:14,076 INFO L413 NwaCegarLoop]: 1376 mSDtfsCounter, 2146 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:33:14,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 2788 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1323 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-21 15:33:14,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2022-07-21 15:33:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2712. [2022-07-21 15:33:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2712 states, 1925 states have (on average 1.2654545454545454) internal successors, (2436), 1974 states have internal predecessors, (2436), 634 states have call successors, (634), 147 states have call predecessors, (634), 148 states have return successors, (656), 627 states have call predecessors, (656), 632 states have call successors, (656) [2022-07-21 15:33:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 3726 transitions. [2022-07-21 15:33:14,230 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 3726 transitions. Word has length 180 [2022-07-21 15:33:14,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:33:14,231 INFO L495 AbstractCegarLoop]: Abstraction has 2712 states and 3726 transitions. [2022-07-21 15:33:14,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 4 states have internal predecessors, (112), 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-21 15:33:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 3726 transitions. [2022-07-21 15:33:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-21 15:33:14,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:33:14,234 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:33:14,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 15:33:14,235 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting elants_i2c_calibrateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 25 more)] === [2022-07-21 15:33:14,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:33:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash -200628028, now seen corresponding path program 1 times [2022-07-21 15:33:14,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:33:14,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909588417] [2022-07-21 15:33:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:33:14,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:33:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:33:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:33:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:33:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 15:33:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 15:33:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:33:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 15:33:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 15:33:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 15:33:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 15:33:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 15:33:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 15:33:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 15:33:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 15:33:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-21 15:33:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:33:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 15:33:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 15:33:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 15:33:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 15:33:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-21 15:33:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-21 15:33:15,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2022-07-21 15:33:15,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:33:15,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909588417] [2022-07-21 15:33:15,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909588417] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:33:15,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240335639] [2022-07-21 15:33:15,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:33:15,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:33:15,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:33:15,505 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-21 15:33:15,506 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-21 15:33:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 2976 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-21 15:33:16,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:33:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 167 proven. 3 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2022-07-21 15:33:16,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:33:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 9 proven. 51 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2022-07-21 15:33:16,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240335639] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 15:33:16,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 15:33:16,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 24 [2022-07-21 15:33:16,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393124931] [2022-07-21 15:33:16,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 15:33:16,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-21 15:33:16,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:33:16,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-21 15:33:16,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2022-07-21 15:33:16,910 INFO L87 Difference]: Start difference. First operand 2712 states and 3726 transitions. Second operand has 24 states, 23 states have (on average 5.3478260869565215) internal successors, (123), 18 states have internal predecessors, (123), 7 states have call successors, (57), 6 states have call predecessors, (57), 5 states have return successors, (49), 8 states have call predecessors, (49), 7 states have call successors, (49) [2022-07-21 15:33:18,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:33:20,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:33:23,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:33:25,028 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []