./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 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--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-?-6c24879 [2022-07-12 16:55:49,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 16:55:49,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 16:55:49,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 16:55:49,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 16:55:49,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 16:55:49,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 16:55:49,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 16:55:49,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 16:55:49,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 16:55:49,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 16:55:49,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 16:55:49,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 16:55:49,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 16:55:49,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 16:55:49,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 16:55:49,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 16:55:49,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 16:55:49,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 16:55:49,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 16:55:49,978 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 16:55:49,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 16:55:49,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 16:55:49,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 16:55:49,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 16:55:49,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 16:55:49,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 16:55:49,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 16:55:49,987 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 16:55:49,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 16:55:49,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 16:55:49,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 16:55:49,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 16:55:49,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 16:55:49,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 16:55:49,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 16:55:49,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 16:55:49,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 16:55:49,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 16:55:49,993 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 16:55:49,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 16:55:49,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 16:55:49,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 16:55:50,027 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 16:55:50,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 16:55:50,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 16:55:50,028 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 16:55:50,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 16:55:50,029 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 16:55:50,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 16:55:50,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 16:55:50,030 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 16:55:50,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 16:55:50,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 16:55:50,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 16:55:50,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 16:55:50,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 16:55:50,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 16:55:50,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 16:55:50,033 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 16:55:50,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 16:55:50,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 16:55:50,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 16:55:50,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 16:55:50,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:55:50,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 16:55:50,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 16:55:50,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 16:55:50,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 16:55:50,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 16:55:50,036 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 16:55:50,036 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 16:55:50,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 16:55:50,037 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-12 16:55:50,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 16:55:50,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 16:55:50,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 16:55:50,261 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 16:55:50,261 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 16:55:50,263 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-12 16:55:50,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/970cbb066/5c715874939649cc90af8d026b466260/FLAG8fe7211dc [2022-07-12 16:55:51,078 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 16:55:51,079 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-12 16:55:51,133 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/970cbb066/5c715874939649cc90af8d026b466260/FLAG8fe7211dc [2022-07-12 16:55:51,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/970cbb066/5c715874939649cc90af8d026b466260 [2022-07-12 16:55:51,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 16:55:51,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 16:55:51,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 16:55:51,350 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 16:55:51,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 16:55:51,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:55:51" (1/1) ... [2022-07-12 16:55:51,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64343895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:51, skipping insertion in model container [2022-07-12 16:55:51,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:55:51" (1/1) ... [2022-07-12 16:55:51,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 16:55:51,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 16:55:53,969 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,978 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,979 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303820,303833] [2022-07-12 16:55:53,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[303969,303982] [2022-07-12 16:55:53,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[304117,304130] [2022-07-12 16:55:53,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:53,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305464,305477] [2022-07-12 16:55:53,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305618,305631] [2022-07-12 16:55:53,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305769,305782] [2022-07-12 16:55:53,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[305924,305937] [2022-07-12 16:55:53,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306076,306089] [2022-07-12 16:55:53,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306231,306244] [2022-07-12 16:55:53,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306395,306408] [2022-07-12 16:55:53,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306551,306564] [2022-07-12 16:55:53,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306715,306728] [2022-07-12 16:55:53,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[306857,306870] [2022-07-12 16:55:53,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307015,307028] [2022-07-12 16:55:53,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307182,307195] [2022-07-12 16:55:53,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307341,307354] [2022-07-12 16:55:53,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307500,307513] [2022-07-12 16:55:53,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307649,307662] [2022-07-12 16:55:53,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307796,307809] [2022-07-12 16:55:53,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[307935,307948] [2022-07-12 16:55:53,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308098,308111] [2022-07-12 16:55:53,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308264,308277] [2022-07-12 16:55:53,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308428,308441] [2022-07-12 16:55:53,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308593,308606] [2022-07-12 16:55:53,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308758,308771] [2022-07-12 16:55:53,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[308924,308937] [2022-07-12 16:55:53,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309089,309102] [2022-07-12 16:55:53,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309256,309269] [2022-07-12 16:55:53,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309416,309429] [2022-07-12 16:55:53,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309578,309591] [2022-07-12 16:55:53,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309737,309750] [2022-07-12 16:55:53,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[309883,309896] [2022-07-12 16:55:53,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310026,310039] [2022-07-12 16:55:53,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310170,310183] [2022-07-12 16:55:54,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310313,310326] [2022-07-12 16:55:54,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310457,310470] [2022-07-12 16:55:54,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310598,310611] [2022-07-12 16:55:54,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310736,310749] [2022-07-12 16:55:54,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[310894,310907] [2022-07-12 16:55:54,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311053,311066] [2022-07-12 16:55:54,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311209,311222] [2022-07-12 16:55:54,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311358,311371] [2022-07-12 16:55:54,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311510,311523] [2022-07-12 16:55:54,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311661,311674] [2022-07-12 16:55:54,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311810,311823] [2022-07-12 16:55:54,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[311962,311975] [2022-07-12 16:55:54,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312110,312123] [2022-07-12 16:55:54,004 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312263,312276] [2022-07-12 16:55:54,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312414,312427] [2022-07-12 16:55:54,005 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312564,312577] [2022-07-12 16:55:54,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312711,312724] [2022-07-12 16:55:54,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[312862,312875] [2022-07-12 16:55:54,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313013,313026] [2022-07-12 16:55:54,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[313981,313994] [2022-07-12 16:55:54,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314128,314141] [2022-07-12 16:55:54,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314289,314302] [2022-07-12 16:55:54,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314459,314472] [2022-07-12 16:55:54,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i[314621,314634] [2022-07-12 16:55:54,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:55:54,043 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 16:55:54,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[301233,301246] [2022-07-12 16:55:54,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[301378,301391] [2022-07-12 16:55:54,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[301524,301537] [2022-07-12 16:55:54,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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-12 16:55:54,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:55:54,548 INFO L208 MainTranslator]: Completed translation [2022-07-12 16:55:54,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:54 WrapperNode [2022-07-12 16:55:54,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 16:55:54,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 16:55:54,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 16:55:54,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 16:55:54,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:54" (1/1) ... [2022-07-12 16:55:54,657 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:54" (1/1) ... [2022-07-12 16:55:54,829 INFO L137 Inliner]: procedures = 537, calls = 1891, calls flagged for inlining = 255, calls inlined = 172, statements flattened = 4095 [2022-07-12 16:55:54,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 16:55:54,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 16:55:54,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 16:55:54,831 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 16:55:54,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:54" (1/1) ... [2022-07-12 16:55:54,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:54" (1/1) ... [2022-07-12 16:55:54,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:54" (1/1) ... [2022-07-12 16:55:54,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:54" (1/1) ... [2022-07-12 16:55:54,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:54" (1/1) ... [2022-07-12 16:55:54,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:54" (1/1) ... [2022-07-12 16:55:54,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:54" (1/1) ... [2022-07-12 16:55:55,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 16:55:55,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 16:55:55,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 16:55:55,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 16:55:55,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:54" (1/1) ... [2022-07-12 16:55:55,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:55:55,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:55:55,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 16:55:55,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 16:55:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-12 16:55:55,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-12 16:55:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:55:55,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:55:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 16:55:55,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 16:55:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:55:55,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:55:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:55:55,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:55:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:55:55,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:55:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_parse_version [2022-07-12 16:55:55,093 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_parse_version [2022-07-12 16:55:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-07-12 16:55:55,093 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-07-12 16:55:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-12 16:55:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 16:55:55,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 16:55:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_remove_sysfs_group [2022-07-12 16:55:55,094 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_remove_sysfs_group [2022-07-12 16:55:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 16:55:55,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 16:55:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:55:55,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:55:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 16:55:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:55:55,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:55:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure input_abs_set_res [2022-07-12 16:55:55,095 INFO L138 BoogieDeclarations]: Found implementation of procedure input_abs_set_res [2022-07-12 16:55:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure write_update_fw [2022-07-12 16:55:55,095 INFO L138 BoogieDeclarations]: Found implementation of procedure write_update_fw [2022-07-12 16:55:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 16:55:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 16:55:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 16:55:55,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 16:55:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:55:55,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:55:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 16:55:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:55:55,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:55:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_get_clientdata [2022-07-12 16:55:55,097 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_get_clientdata [2022-07-12 16:55:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:55:55,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:55:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_suspend [2022-07-12 16:55:55,097 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_suspend [2022-07-12 16:55:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:55:55,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:55:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:55:55,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:55:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 16:55:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 16:55:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 16:55:55,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 16:55:55,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 16:55:55,099 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 16:55:55,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 16:55:55,099 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:55:55,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:55:55,099 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_master_recv [2022-07-12 16:55:55,099 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_master_recv [2022-07-12 16:55:55,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:55:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:55:55,100 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_send [2022-07-12 16:55:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_send [2022-07-12 16:55:55,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 16:55:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 16:55:55,100 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-07-12 16:55:55,100 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-07-12 16:55:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 16:55:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 16:55:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 16:55:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 16:55:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure elants_version_attribute_show [2022-07-12 16:55:55,101 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_version_attribute_show [2022-07-12 16:55:55,101 INFO L130 BoogieDeclarations]: Found specification of procedure disable_irq [2022-07-12 16:55:55,102 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_irq [2022-07-12 16:55:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_sw_reset [2022-07-12 16:55:55,102 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_sw_reset [2022-07-12 16:55:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:55:55,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:55:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_calibrate [2022-07-12 16:55:55,102 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_calibrate [2022-07-12 16:55:55,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:55:55,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:55:55,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 16:55:55,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:55:55,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:55:55,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 16:55:55,103 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-12 16:55:55,103 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-12 16:55:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 16:55:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_resume [2022-07-12 16:55:55,104 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_resume [2022-07-12 16:55:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure calibrate_store [2022-07-12 16:55:55,104 INFO L138 BoogieDeclarations]: Found implementation of procedure calibrate_store [2022-07-12 16:55:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:55:55,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:55:55,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 16:55:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 16:55:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:55:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:55:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:55:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:55:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:55:55,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:55:55,105 INFO L130 BoogieDeclarations]: Found specification of procedure irq_set_irq_wake [2022-07-12 16:55:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure irq_set_irq_wake [2022-07-12 16:55:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_be16 [2022-07-12 16:55:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_be16 [2022-07-12 16:55:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:55:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:55:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:55:55,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:55:55,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 16:55:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:55:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:55:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_initialize [2022-07-12 16:55:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_initialize [2022-07-12 16:55:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 16:55:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 16:55:55,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_sysfs_mutex_of_elants_data [2022-07-12 16:55:55,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_sysfs_mutex_of_elants_data [2022-07-12 16:55:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure enable_irq [2022-07-12 16:55:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_irq [2022-07-12 16:55:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:55:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:55:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-12 16:55:55,108 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-12 16:55:55,108 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_read [2022-07-12 16:55:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_read [2022-07-12 16:55:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure __set_bit [2022-07-12 16:55:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure __set_bit [2022-07-12 16:55:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sysfs_mutex_of_elants_data [2022-07-12 16:55:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_sysfs_mutex_of_elants_data [2022-07-12 16:55:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure device_may_wakeup [2022-07-12 16:55:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure device_may_wakeup [2022-07-12 16:55:55,109 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_execute_command [2022-07-12 16:55:55,109 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_execute_command [2022-07-12 16:55:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 16:55:55,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 16:55:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:55:55,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:55:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 16:55:55,110 INFO L130 BoogieDeclarations]: Found specification of procedure elants_i2c_event [2022-07-12 16:55:55,110 INFO L138 BoogieDeclarations]: Found implementation of procedure elants_i2c_event [2022-07-12 16:55:55,689 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 16:55:55,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 16:55:55,848 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 16:56:06,782 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 16:56:06,796 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 16:56:06,796 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 16:56:06,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:56:06 BoogieIcfgContainer [2022-07-12 16:56:06,800 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 16:56:06,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 16:56:06,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 16:56:06,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 16:56:06,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:55:51" (1/3) ... [2022-07-12 16:56:06,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550fb275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:56:06, skipping insertion in model container [2022-07-12 16:56:06,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:55:54" (2/3) ... [2022-07-12 16:56:06,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@550fb275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:56:06, skipping insertion in model container [2022-07-12 16:56:06,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:56:06" (3/3) ... [2022-07-12 16:56:06,810 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--input--touchscreen--elants_i2c.ko.cil.i [2022-07-12 16:56:06,825 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 16:56:06,826 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-12 16:56:06,911 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 16:56:06,915 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@112d8916, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c771f35 [2022-07-12 16:56:06,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-12 16:56:06,924 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-12 16:56:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 16:56:06,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:06,938 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-12 16:56:06,938 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-12 16:56:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:06,945 INFO L85 PathProgramCache]: Analyzing trace with hash 397725343, now seen corresponding path program 1 times [2022-07-12 16:56:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:06,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715553871] [2022-07-12 16:56:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:06,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:56:07,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:56:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:56:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:56:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:56:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:56:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:07,716 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-12 16:56:07,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:07,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715553871] [2022-07-12 16:56:07,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715553871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:07,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:07,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853697513] [2022-07-12 16:56:07,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:07,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:07,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:07,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:07,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:07,758 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-12 16:56:09,812 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-12 16:56:11,826 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-12 16:56:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:16,066 INFO L93 Difference]: Finished difference Result 2289 states and 3162 transitions. [2022-07-12 16:56:16,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:16,069 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-12 16:56:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:16,095 INFO L225 Difference]: With dead ends: 2289 [2022-07-12 16:56:16,097 INFO L226 Difference]: Without dead ends: 1142 [2022-07-12 16:56:16,112 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-12 16:56:16,114 INFO L413 NwaCegarLoop]: 1441 mSDtfsCounter, 2301 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 914 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.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, 8.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:16,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2464 Valid, 2901 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 1373 Invalid, 2 Unknown, 0 Unchecked, 8.0s Time] [2022-07-12 16:56:16,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-07-12 16:56:16,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1142. [2022-07-12 16:56:16,241 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-12 16:56:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1519 transitions. [2022-07-12 16:56:16,254 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1519 transitions. Word has length 64 [2022-07-12 16:56:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:16,256 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1519 transitions. [2022-07-12 16:56:16,256 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-12 16:56:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1519 transitions. [2022-07-12 16:56:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 16:56:16,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:16,260 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-12 16:56:16,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 16:56:16,260 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-12 16:56:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:16,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1378894902, now seen corresponding path program 1 times [2022-07-12 16:56:16,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:16,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987697775] [2022-07-12 16:56:16,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:16,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:16,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:16,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:56:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:16,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:56:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:16,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:56:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:56:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:16,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:56:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:16,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:56:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:56:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:16,520 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-12 16:56:16,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:16,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987697775] [2022-07-12 16:56:16,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987697775] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:16,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:16,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:16,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441771950] [2022-07-12 16:56:16,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:16,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:16,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:16,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:16,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:16,524 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-12 16:56:18,552 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-12 16:56:20,574 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-12 16:56:25,051 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-12 16:56:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:26,221 INFO L93 Difference]: Finished difference Result 1142 states and 1519 transitions. [2022-07-12 16:56:26,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:26,222 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-12 16:56:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:26,231 INFO L225 Difference]: With dead ends: 1142 [2022-07-12 16:56:26,231 INFO L226 Difference]: Without dead ends: 1140 [2022-07-12 16:56:26,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:26,233 INFO L413 NwaCegarLoop]: 1421 mSDtfsCounter, 2267 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:26,233 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.5s Time] [2022-07-12 16:56:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2022-07-12 16:56:26,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2022-07-12 16:56:26,279 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-12 16:56:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1517 transitions. [2022-07-12 16:56:26,286 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1517 transitions. Word has length 70 [2022-07-12 16:56:26,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:26,287 INFO L495 AbstractCegarLoop]: Abstraction has 1140 states and 1517 transitions. [2022-07-12 16:56:26,287 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-12 16:56:26,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1517 transitions. [2022-07-12 16:56:26,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 16:56:26,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:26,290 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-12 16:56:26,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 16:56:26,290 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-12 16:56:26,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:26,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1387426283, now seen corresponding path program 1 times [2022-07-12 16:56:26,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:26,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218273788] [2022-07-12 16:56:26,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:56:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:56:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:56:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:56:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:56:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:56:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:56:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:56:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:26,598 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-12 16:56:26,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:26,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218273788] [2022-07-12 16:56:26,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218273788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:26,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:26,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:26,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962474842] [2022-07-12 16:56:26,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:26,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:26,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:26,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:26,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:26,601 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-12 16:56:28,630 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-12 16:56:30,656 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-12 16:56:34,815 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-12 16:56:37,122 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-12 16:56:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:38,256 INFO L93 Difference]: Finished difference Result 1140 states and 1517 transitions. [2022-07-12 16:56:38,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:38,257 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-12 16:56:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:38,264 INFO L225 Difference]: With dead ends: 1140 [2022-07-12 16:56:38,264 INFO L226 Difference]: Without dead ends: 1138 [2022-07-12 16:56:38,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:38,266 INFO L413 NwaCegarLoop]: 1419 mSDtfsCounter, 2261 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 904 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 2859 SdHoareTripleChecker+Invalid, 2263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:38,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2420 Valid, 2859 Invalid, 2263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1355 Invalid, 4 Unknown, 0 Unchecked, 11.5s Time] [2022-07-12 16:56:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-07-12 16:56:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2022-07-12 16:56:38,310 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-12 16:56:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1515 transitions. [2022-07-12 16:56:38,317 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1515 transitions. Word has length 76 [2022-07-12 16:56:38,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:38,318 INFO L495 AbstractCegarLoop]: Abstraction has 1138 states and 1515 transitions. [2022-07-12 16:56:38,318 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-12 16:56:38,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1515 transitions. [2022-07-12 16:56:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 16:56:38,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:38,320 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-12 16:56:38,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 16:56:38,320 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-12 16:56:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1256211171, now seen corresponding path program 1 times [2022-07-12 16:56:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:38,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442650012] [2022-07-12 16:56:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:56:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:56:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:56:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:56:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:56:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:56:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:56:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:56:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:56:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:38,566 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-12 16:56:38,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:38,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442650012] [2022-07-12 16:56:38,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442650012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:38,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:38,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:38,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715638668] [2022-07-12 16:56:38,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:38,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:38,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:38,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:38,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:38,571 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-12 16:56:40,599 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-12 16:56:42,617 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-12 16:56:47,070 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-12 16:56:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:48,306 INFO L93 Difference]: Finished difference Result 1138 states and 1515 transitions. [2022-07-12 16:56:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:48,306 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-12 16:56:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:48,313 INFO L225 Difference]: With dead ends: 1138 [2022-07-12 16:56:48,313 INFO L226 Difference]: Without dead ends: 1136 [2022-07-12 16:56:48,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:48,315 INFO L413 NwaCegarLoop]: 1417 mSDtfsCounter, 2255 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 2857 SdHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:48,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 2857 Invalid, 2261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1354 Invalid, 3 Unknown, 0 Unchecked, 9.6s Time] [2022-07-12 16:56:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2022-07-12 16:56:48,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1136. [2022-07-12 16:56:48,356 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-12 16:56:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1513 transitions. [2022-07-12 16:56:48,362 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1513 transitions. Word has length 82 [2022-07-12 16:56:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:48,363 INFO L495 AbstractCegarLoop]: Abstraction has 1136 states and 1513 transitions. [2022-07-12 16:56:48,363 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-12 16:56:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1513 transitions. [2022-07-12 16:56:48,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-12 16:56:48,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:48,365 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-12 16:56:48,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 16:56:48,365 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-12 16:56:48,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1973731712, now seen corresponding path program 1 times [2022-07-12 16:56:48,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:48,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224227593] [2022-07-12 16:56:48,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:48,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:56:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:56:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:56:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:56:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:56:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:56:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:56:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:56:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:56:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:56:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:48,608 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-12 16:56:48,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:48,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224227593] [2022-07-12 16:56:48,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224227593] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:48,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:48,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:48,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737186297] [2022-07-12 16:56:48,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:48,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:48,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:48,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:48,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:48,612 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-12 16:56:50,639 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-12 16:56:52,657 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-12 16:56:56,804 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-12 16:56:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:56:57,994 INFO L93 Difference]: Finished difference Result 1136 states and 1513 transitions. [2022-07-12 16:56:57,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:56:57,995 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-12 16:56:57,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:56:58,000 INFO L225 Difference]: With dead ends: 1136 [2022-07-12 16:56:58,001 INFO L226 Difference]: Without dead ends: 1134 [2022-07-12 16:56:58,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:56:58,002 INFO L413 NwaCegarLoop]: 1415 mSDtfsCounter, 2249 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 2855 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:56:58,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 2855 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1352 Invalid, 3 Unknown, 0 Unchecked, 9.3s Time] [2022-07-12 16:56:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-07-12 16:56:58,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1134. [2022-07-12 16:56:58,038 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-12 16:56:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1511 transitions. [2022-07-12 16:56:58,042 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1511 transitions. Word has length 88 [2022-07-12 16:56:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:56:58,044 INFO L495 AbstractCegarLoop]: Abstraction has 1134 states and 1511 transitions. [2022-07-12 16:56:58,044 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-12 16:56:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1511 transitions. [2022-07-12 16:56:58,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 16:56:58,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:56:58,050 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-12 16:56:58,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 16:56:58,051 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-12 16:56:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:56:58,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1678572572, now seen corresponding path program 1 times [2022-07-12 16:56:58,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:56:58,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060293889] [2022-07-12 16:56:58,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:56:58,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:56:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:56:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:56:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:56:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:56:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:56:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:56:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:56:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:56:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:56:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:56:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:56:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:56:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:56:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:56:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:56:58,273 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-12 16:56:58,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:56:58,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060293889] [2022-07-12 16:56:58,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060293889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:56:58,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:56:58,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:56:58,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239585231] [2022-07-12 16:56:58,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:56:58,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:56:58,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:56:58,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:56:58,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:56:58,276 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-12 16:57:00,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-12 16:57:02,323 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-12 16:57:06,637 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-12 16:57:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:07,612 INFO L93 Difference]: Finished difference Result 1134 states and 1511 transitions. [2022-07-12 16:57:07,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:07,613 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-12 16:57:07,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:07,618 INFO L225 Difference]: With dead ends: 1134 [2022-07-12 16:57:07,618 INFO L226 Difference]: Without dead ends: 1132 [2022-07-12 16:57:07,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:07,620 INFO L413 NwaCegarLoop]: 1413 mSDtfsCounter, 2243 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.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, 1350 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:07,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 2853 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1350 Invalid, 3 Unknown, 0 Unchecked, 9.2s Time] [2022-07-12 16:57:07,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2022-07-12 16:57:07,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1132. [2022-07-12 16:57:07,656 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-12 16:57:07,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1509 transitions. [2022-07-12 16:57:07,662 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1509 transitions. Word has length 94 [2022-07-12 16:57:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:07,662 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 1509 transitions. [2022-07-12 16:57:07,663 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-12 16:57:07,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1509 transitions. [2022-07-12 16:57:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 16:57:07,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:07,664 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-12 16:57:07,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 16:57:07,665 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-12 16:57:07,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:07,665 INFO L85 PathProgramCache]: Analyzing trace with hash 955210123, now seen corresponding path program 1 times [2022-07-12 16:57:07,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:07,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654283112] [2022-07-12 16:57:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:07,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:57:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:57:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:57:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:57:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:57:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:57:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:57:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:57:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:57:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:57:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:07,876 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-12 16:57:07,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:07,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654283112] [2022-07-12 16:57:07,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654283112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:07,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:07,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:07,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333166358] [2022-07-12 16:57:07,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:07,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:07,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:07,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:07,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:07,879 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-12 16:57:09,908 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-12 16:57:11,923 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-12 16:57:18,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:18,098 INFO L93 Difference]: Finished difference Result 2235 states and 2981 transitions. [2022-07-12 16:57:18,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 16:57:18,099 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-12 16:57:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:18,110 INFO L225 Difference]: With dead ends: 2235 [2022-07-12 16:57:18,111 INFO L226 Difference]: Without dead ends: 2233 [2022-07-12 16:57:18,112 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-12 16:57:18,113 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 3329 mSDsluCounter, 2009 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 1608 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3482 SdHoareTripleChecker+Valid, 3580 SdHoareTripleChecker+Invalid, 4548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1608 IncrementalHoareTripleChecker+Valid, 2938 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:18,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3482 Valid, 3580 Invalid, 4548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1608 Valid, 2938 Invalid, 2 Unknown, 0 Unchecked, 10.0s Time] [2022-07-12 16:57:18,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2022-07-12 16:57:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2096. [2022-07-12 16:57:18,200 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-12 16:57:18,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2096 states to 2096 states and 2833 transitions. [2022-07-12 16:57:18,210 INFO L78 Accepts]: Start accepts. Automaton has 2096 states and 2833 transitions. Word has length 100 [2022-07-12 16:57:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:18,210 INFO L495 AbstractCegarLoop]: Abstraction has 2096 states and 2833 transitions. [2022-07-12 16:57:18,211 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-12 16:57:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states and 2833 transitions. [2022-07-12 16:57:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 16:57:18,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:18,213 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-12 16:57:18,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 16:57:18,213 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-12 16:57:18,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash 474370401, now seen corresponding path program 1 times [2022-07-12 16:57:18,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:18,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334098377] [2022-07-12 16:57:18,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:18,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:57:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:57:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:57:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:57:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:57:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:57:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:57:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:57:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:57:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:57:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:57:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:18,442 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-12 16:57:18,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:18,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334098377] [2022-07-12 16:57:18,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334098377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:18,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:18,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:18,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036846474] [2022-07-12 16:57:18,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:18,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:18,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:18,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:18,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:18,444 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-12 16:57:20,472 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-12 16:57:22,503 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-12 16:57:26,797 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-12 16:57:29,691 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-12 16:57:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:30,007 INFO L93 Difference]: Finished difference Result 2096 states and 2833 transitions. [2022-07-12 16:57:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:30,007 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-12 16:57:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:30,019 INFO L225 Difference]: With dead ends: 2096 [2022-07-12 16:57:30,020 INFO L226 Difference]: Without dead ends: 2094 [2022-07-12 16:57:30,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:30,022 INFO L413 NwaCegarLoop]: 1411 mSDtfsCounter, 2241 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 904 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2395 SdHoareTripleChecker+Valid, 2851 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:30,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2395 Valid, 2851 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1343 Invalid, 4 Unknown, 0 Unchecked, 11.4s Time] [2022-07-12 16:57:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2022-07-12 16:57:30,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2094. [2022-07-12 16:57:30,104 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-12 16:57:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 2831 transitions. [2022-07-12 16:57:30,157 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 2831 transitions. Word has length 106 [2022-07-12 16:57:30,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:30,157 INFO L495 AbstractCegarLoop]: Abstraction has 2094 states and 2831 transitions. [2022-07-12 16:57:30,157 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-12 16:57:30,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 2831 transitions. [2022-07-12 16:57:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-12 16:57:30,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:30,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] [2022-07-12 16:57:30,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 16:57:30,159 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-12 16:57:30,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:30,160 INFO L85 PathProgramCache]: Analyzing trace with hash 603557956, now seen corresponding path program 1 times [2022-07-12 16:57:30,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:30,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455915063] [2022-07-12 16:57:30,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:30,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:57:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:57:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:57:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:57:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:57:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:57:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:57:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:57:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:57:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:57:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:57:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:30,415 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-12 16:57:30,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:30,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455915063] [2022-07-12 16:57:30,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455915063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:30,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:30,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:30,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880619087] [2022-07-12 16:57:30,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:30,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:30,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:30,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:30,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:30,418 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-12 16:57:32,445 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-12 16:57:34,463 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-12 16:57:38,592 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-12 16:57:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:39,537 INFO L93 Difference]: Finished difference Result 2094 states and 2831 transitions. [2022-07-12 16:57:39,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:39,537 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-12 16:57:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:39,547 INFO L225 Difference]: With dead ends: 2094 [2022-07-12 16:57:39,548 INFO L226 Difference]: Without dead ends: 2092 [2022-07-12 16:57:39,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:39,550 INFO L413 NwaCegarLoop]: 1409 mSDtfsCounter, 2229 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2383 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:39,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2383 Valid, 2849 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1346 Invalid, 3 Unknown, 0 Unchecked, 9.0s Time] [2022-07-12 16:57:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2022-07-12 16:57:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 2092. [2022-07-12 16:57:39,631 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-12 16:57:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2092 states to 2092 states and 2829 transitions. [2022-07-12 16:57:39,639 INFO L78 Accepts]: Start accepts. Automaton has 2092 states and 2829 transitions. Word has length 108 [2022-07-12 16:57:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:39,639 INFO L495 AbstractCegarLoop]: Abstraction has 2092 states and 2829 transitions. [2022-07-12 16:57:39,639 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-12 16:57:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2092 states and 2829 transitions. [2022-07-12 16:57:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 16:57:39,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:39,641 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-12 16:57:39,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 16:57:39,642 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-12 16:57:39,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash -998949483, now seen corresponding path program 1 times [2022-07-12 16:57:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:39,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856305656] [2022-07-12 16:57:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:39,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:57:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:57:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:57:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:57:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:57:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:57:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 16:57:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:57:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:57:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:57:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:57:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:57:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:57:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:39,903 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-12 16:57:39,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:39,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856305656] [2022-07-12 16:57:39,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856305656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:39,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:39,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:39,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263748990] [2022-07-12 16:57:39,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:39,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:39,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:39,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:39,905 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-12 16:57:41,931 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-12 16:57:43,948 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-12 16:57:45,965 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-12 16:57:50,259 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-12 16:57:51,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:51,544 INFO L93 Difference]: Finished difference Result 3620 states and 4844 transitions. [2022-07-12 16:57:51,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 16:57:51,545 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-12 16:57:51,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:51,555 INFO L225 Difference]: With dead ends: 3620 [2022-07-12 16:57:51,555 INFO L226 Difference]: Without dead ends: 2098 [2022-07-12 16:57:51,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 16:57:51,561 INFO L413 NwaCegarLoop]: 1225 mSDtfsCounter, 2454 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 1216 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:51,562 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.5s Time] [2022-07-12 16:57:51,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2098 states. [2022-07-12 16:57:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2098 to 2086. [2022-07-12 16:57:51,647 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-12 16:57:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 2820 transitions. [2022-07-12 16:57:51,655 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 2820 transitions. Word has length 129 [2022-07-12 16:57:51,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:51,655 INFO L495 AbstractCegarLoop]: Abstraction has 2086 states and 2820 transitions. [2022-07-12 16:57:51,656 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-12 16:57:51,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2820 transitions. [2022-07-12 16:57:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 16:57:51,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:51,658 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-12 16:57:51,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 16:57:51,658 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-12 16:57:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash -576112153, now seen corresponding path program 1 times [2022-07-12 16:57:51,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:51,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242207716] [2022-07-12 16:57:51,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:51,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:57:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:57:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:57:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:57:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:57:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:57:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:57:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:57:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:57:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:57:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:57:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:57:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:57:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:57:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:57:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:51,875 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-12 16:57:51,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:51,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242207716] [2022-07-12 16:57:51,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242207716] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:51,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:51,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:51,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444689400] [2022-07-12 16:57:51,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:51,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:51,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:51,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:51,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:51,878 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-12 16:57:53,904 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-12 16:57:55,928 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-12 16:58:00,081 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-12 16:58:01,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:01,221 INFO L93 Difference]: Finished difference Result 2086 states and 2820 transitions. [2022-07-12 16:58:01,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:01,222 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-12 16:58:01,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:01,233 INFO L225 Difference]: With dead ends: 2086 [2022-07-12 16:58:01,233 INFO L226 Difference]: Without dead ends: 2084 [2022-07-12 16:58:01,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:01,237 INFO L413 NwaCegarLoop]: 1402 mSDtfsCounter, 2220 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s 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, 9.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:01,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2373 Valid, 2828 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1343 Invalid, 3 Unknown, 0 Unchecked, 9.2s Time] [2022-07-12 16:58:01,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2022-07-12 16:58:01,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2084. [2022-07-12 16:58:01,335 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-12 16:58:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2818 transitions. [2022-07-12 16:58:01,344 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2818 transitions. Word has length 114 [2022-07-12 16:58:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:01,346 INFO L495 AbstractCegarLoop]: Abstraction has 2084 states and 2818 transitions. [2022-07-12 16:58:01,347 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-12 16:58:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2818 transitions. [2022-07-12 16:58:01,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 16:58:01,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:01,349 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-12 16:58:01,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 16:58:01,350 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-12 16:58:01,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:01,350 INFO L85 PathProgramCache]: Analyzing trace with hash -227467516, now seen corresponding path program 1 times [2022-07-12 16:58:01,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:01,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752595495] [2022-07-12 16:58:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:01,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:58:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:58:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:58:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:58:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:58:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:58:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 16:58:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:58:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:58:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:58:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:58:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 16:58:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 16:58:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:01,611 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-12 16:58:01,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:01,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752595495] [2022-07-12 16:58:01,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752595495] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 16:58:01,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293685637] [2022-07-12 16:58:01,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:01,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 16:58:01,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:58:01,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 16:58:01,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 16:58:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 2216 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 16:58:02,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 16:58:02,508 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-12 16:58:02,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 16:58:02,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293685637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:02,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 16:58:02,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-12 16:58:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311531295] [2022-07-12 16:58:02,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:02,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 16:58:02,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:02,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 16:58:02,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:02,510 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-12 16:58:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:02,633 INFO L93 Difference]: Finished difference Result 3592 states and 4804 transitions. [2022-07-12 16:58:02,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 16:58:02,634 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-12 16:58:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:02,644 INFO L225 Difference]: With dead ends: 3592 [2022-07-12 16:58:02,644 INFO L226 Difference]: Without dead ends: 2078 [2022-07-12 16:58:02,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:02,650 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-12 16:58:02,650 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-12 16:58:02,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2022-07-12 16:58:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 2078. [2022-07-12 16:58:02,749 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-12 16:58:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 2809 transitions. [2022-07-12 16:58:02,757 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 2809 transitions. Word has length 135 [2022-07-12 16:58:02,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:02,758 INFO L495 AbstractCegarLoop]: Abstraction has 2078 states and 2809 transitions. [2022-07-12 16:58:02,758 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-12 16:58:02,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 2809 transitions. [2022-07-12 16:58:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 16:58:02,760 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:02,760 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-12 16:58:02,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 16:58:02,983 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-12 16:58:02,983 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-12 16:58:02,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash 920618242, now seen corresponding path program 1 times [2022-07-12 16:58:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:02,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987239675] [2022-07-12 16:58:02,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:58:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:58:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:58:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:58:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:58:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:58:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:58:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:58:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:58:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:58:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:58:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:58:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:58:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:03,257 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-12 16:58:03,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:03,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987239675] [2022-07-12 16:58:03,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987239675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:03,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:03,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:03,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008586654] [2022-07-12 16:58:03,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:03,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:03,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:03,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:03,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:03,259 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-12 16:58:05,286 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-12 16:58:07,304 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-12 16:58:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:10,490 INFO L93 Difference]: Finished difference Result 2078 states and 2809 transitions. [2022-07-12 16:58:10,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:10,491 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-12 16:58:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:10,500 INFO L225 Difference]: With dead ends: 2078 [2022-07-12 16:58:10,501 INFO L226 Difference]: Without dead ends: 2076 [2022-07-12 16:58:10,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:10,502 INFO L413 NwaCegarLoop]: 1395 mSDtfsCounter, 2209 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 1341 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:10,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 2807 Invalid, 2247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1341 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-07-12 16:58:10,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2022-07-12 16:58:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2076. [2022-07-12 16:58:10,599 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-12 16:58:10,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2076 states to 2076 states and 2807 transitions. [2022-07-12 16:58:10,606 INFO L78 Accepts]: Start accepts. Automaton has 2076 states and 2807 transitions. Word has length 120 [2022-07-12 16:58:10,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:10,606 INFO L495 AbstractCegarLoop]: Abstraction has 2076 states and 2807 transitions. [2022-07-12 16:58:10,606 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-12 16:58:10,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2076 states and 2807 transitions. [2022-07-12 16:58:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 16:58:10,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:10,609 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-12 16:58:10,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 16:58:10,609 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-12 16:58:10,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:10,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1966366827, now seen corresponding path program 1 times [2022-07-12 16:58:10,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:10,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095417505] [2022-07-12 16:58:10,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:10,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:58:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:58:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:58:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:58:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:58:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:58:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:10,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:58:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:58:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:58:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:58:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:58:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:58:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:58:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:58:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,904 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-12 16:58:10,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:10,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095417505] [2022-07-12 16:58:10,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095417505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:10,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:10,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:10,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313603661] [2022-07-12 16:58:10,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:10,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:10,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:10,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:10,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:10,908 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-12 16:58:12,937 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-12 16:58:14,962 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-12 16:58:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:18,092 INFO L93 Difference]: Finished difference Result 2076 states and 2807 transitions. [2022-07-12 16:58:18,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:18,093 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-12 16:58:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:18,102 INFO L225 Difference]: With dead ends: 2076 [2022-07-12 16:58:18,102 INFO L226 Difference]: Without dead ends: 2074 [2022-07-12 16:58:18,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:18,104 INFO L413 NwaCegarLoop]: 1393 mSDtfsCounter, 2203 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:18,104 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.0s Time] [2022-07-12 16:58:18,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2022-07-12 16:58:18,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 2074. [2022-07-12 16:58:18,204 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-12 16:58:18,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 2805 transitions. [2022-07-12 16:58:18,211 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 2805 transitions. Word has length 126 [2022-07-12 16:58:18,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:18,211 INFO L495 AbstractCegarLoop]: Abstraction has 2074 states and 2805 transitions. [2022-07-12 16:58:18,212 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-12 16:58:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 2805 transitions. [2022-07-12 16:58:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-12 16:58:18,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:18,215 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-12 16:58:18,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 16:58:18,215 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-12 16:58:18,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1374776284, now seen corresponding path program 1 times [2022-07-12 16:58:18,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:18,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176066738] [2022-07-12 16:58:18,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:18,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:58:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:58:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:58:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:58:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:58:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:58:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:58:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:58:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:58:18,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:58:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:58:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:58:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:58:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:58:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:58:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:18,459 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-12 16:58:18,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:18,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176066738] [2022-07-12 16:58:18,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176066738] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:18,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:18,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:18,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098846534] [2022-07-12 16:58:18,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:18,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:18,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:18,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:18,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:18,463 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-12 16:58:20,490 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-12 16:58:22,513 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-12 16:58:26,655 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-12 16:58:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:27,767 INFO L93 Difference]: Finished difference Result 2074 states and 2805 transitions. [2022-07-12 16:58:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:27,768 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-12 16:58:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:27,776 INFO L225 Difference]: With dead ends: 2074 [2022-07-12 16:58:27,777 INFO L226 Difference]: Without dead ends: 2072 [2022-07-12 16:58:27,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:27,778 INFO L413 NwaCegarLoop]: 1391 mSDtfsCounter, 2197 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:27,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2347 Valid, 2803 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1336 Invalid, 3 Unknown, 0 Unchecked, 9.1s Time] [2022-07-12 16:58:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2022-07-12 16:58:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 2072. [2022-07-12 16:58:27,880 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-12 16:58:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2803 transitions. [2022-07-12 16:58:27,886 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2803 transitions. Word has length 132 [2022-07-12 16:58:27,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:27,887 INFO L495 AbstractCegarLoop]: Abstraction has 2072 states and 2803 transitions. [2022-07-12 16:58:27,887 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-12 16:58:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2803 transitions. [2022-07-12 16:58:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 16:58:27,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:27,891 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-12 16:58:27,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 16:58:27,891 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-12 16:58:27,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:27,892 INFO L85 PathProgramCache]: Analyzing trace with hash 311265212, now seen corresponding path program 1 times [2022-07-12 16:58:27,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:27,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397233906] [2022-07-12 16:58:27,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:58:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:58:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:58:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:58:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:58:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:58:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:58:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:58:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:58:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:58:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:58:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:58:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:58:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:58:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:58:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 16:58:28,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:28,126 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-12 16:58:28,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:28,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397233906] [2022-07-12 16:58:28,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397233906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:28,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:28,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:28,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177495202] [2022-07-12 16:58:28,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:28,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:28,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:28,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:28,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:28,128 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-12 16:58:30,163 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-12 16:58:32,185 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-12 16:58:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:35,459 INFO L93 Difference]: Finished difference Result 2072 states and 2803 transitions. [2022-07-12 16:58:35,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:35,460 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-12 16:58:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:35,469 INFO L225 Difference]: With dead ends: 2072 [2022-07-12 16:58:35,469 INFO L226 Difference]: Without dead ends: 2070 [2022-07-12 16:58:35,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:35,471 INFO L413 NwaCegarLoop]: 1389 mSDtfsCounter, 2191 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.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, 1335 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:35,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2340 Valid, 2801 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1335 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-07-12 16:58:35,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2022-07-12 16:58:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2070. [2022-07-12 16:58:35,572 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-12 16:58:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 2801 transitions. [2022-07-12 16:58:35,579 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 2801 transitions. Word has length 138 [2022-07-12 16:58:35,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:35,579 INFO L495 AbstractCegarLoop]: Abstraction has 2070 states and 2801 transitions. [2022-07-12 16:58:35,579 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-12 16:58:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 2801 transitions. [2022-07-12 16:58:35,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 16:58:35,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:35,583 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-12 16:58:35,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 16:58:35,583 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-12 16:58:35,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:35,584 INFO L85 PathProgramCache]: Analyzing trace with hash 86212839, now seen corresponding path program 1 times [2022-07-12 16:58:35,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:35,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913649708] [2022-07-12 16:58:35,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:35,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:58:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:58:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:58:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:58:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:58:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:58:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 16:58:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 16:58:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 16:58:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 16:58:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 16:58:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 16:58:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 16:58:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-12 16:58:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:58:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 16:58:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:35,972 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-12 16:58:35,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:35,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913649708] [2022-07-12 16:58:35,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913649708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:35,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:35,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:58:35,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729305408] [2022-07-12 16:58:35,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:35,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:58:35,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:35,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:58:35,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:58:35,976 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-12 16:58:38,003 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-12 16:58:40,025 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-12 16:58:42,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-12 16:58:49,805 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-12 16:58:55,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:55,244 INFO L93 Difference]: Finished difference Result 3069 states and 4118 transitions. [2022-07-12 16:58:55,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 16:58:55,245 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-12 16:58:55,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:55,256 INFO L225 Difference]: With dead ends: 3069 [2022-07-12 16:58:55,257 INFO L226 Difference]: Without dead ends: 3067 [2022-07-12 16:58:55,258 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-12 16:58:55,259 INFO L413 NwaCegarLoop]: 1581 mSDtfsCounter, 3107 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 4307 mSolverCounterSat, 1599 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3260 SdHoareTripleChecker+Valid, 4115 SdHoareTripleChecker+Invalid, 5910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1599 IncrementalHoareTripleChecker+Valid, 4307 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:55,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3260 Valid, 4115 Invalid, 5910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1599 Valid, 4307 Invalid, 4 Unknown, 0 Unchecked, 18.9s Time] [2022-07-12 16:58:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2022-07-12 16:58:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 3010. [2022-07-12 16:58:55,416 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-12 16:58:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 4056 transitions. [2022-07-12 16:58:55,427 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 4056 transitions. Word has length 183 [2022-07-12 16:58:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:55,428 INFO L495 AbstractCegarLoop]: Abstraction has 3010 states and 4056 transitions. [2022-07-12 16:58:55,428 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-12 16:58:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 4056 transitions. [2022-07-12 16:58:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-12 16:58:55,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:55,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 16:58:55,480 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-12 16:58:55,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash 268626821, now seen corresponding path program 1 times [2022-07-12 16:58:55,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:55,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699449525] [2022-07-12 16:58:55,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:55,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:58:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:58:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:58:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:58:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:58:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:58:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:58:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:58:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:58:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:58:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:58:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:58:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:58:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:58:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:58:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:58:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:58:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:58:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 16:58:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 16:58:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,771 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-12 16:58:55,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:55,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699449525] [2022-07-12 16:58:55,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699449525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:55,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:55,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:55,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221572056] [2022-07-12 16:58:55,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:55,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:55,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:55,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:55,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:55,774 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-12 16:58:57,804 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-12 16:58:59,824 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-12 16:59:04,836 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 16:59:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:04,954 INFO L93 Difference]: Finished difference Result 3010 states and 4056 transitions. [2022-07-12 16:59:04,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:04,955 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-12 16:59:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:04,966 INFO L225 Difference]: With dead ends: 3010 [2022-07-12 16:59:04,966 INFO L226 Difference]: Without dead ends: 3008 [2022-07-12 16:59:04,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:59:04,968 INFO L413 NwaCegarLoop]: 1387 mSDtfsCounter, 2185 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2333 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:04,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2333 Valid, 2799 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1333 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2022-07-12 16:59:04,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2022-07-12 16:59:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2022-07-12 16:59:05,118 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-12 16:59:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4053 transitions. [2022-07-12 16:59:05,129 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4053 transitions. Word has length 144 [2022-07-12 16:59:05,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:05,129 INFO L495 AbstractCegarLoop]: Abstraction has 3008 states and 4053 transitions. [2022-07-12 16:59:05,129 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-12 16:59:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4053 transitions. [2022-07-12 16:59:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 16:59:05,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:05,133 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-12 16:59:05,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 16:59:05,134 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-12 16:59:05,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:05,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1181738883, now seen corresponding path program 1 times [2022-07-12 16:59:05,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:05,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791946387] [2022-07-12 16:59:05,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:59:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:59:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:59:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:59:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:59:05,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:59:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:59:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:59:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:59:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:59:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:59:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:59:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:59:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:59:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:59:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:59:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:59:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 16:59:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 16:59:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 16:59:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:05,342 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-12 16:59:05,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:05,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791946387] [2022-07-12 16:59:05,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791946387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:05,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:05,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:05,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246216929] [2022-07-12 16:59:05,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:05,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:05,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:05,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:05,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:05,346 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-12 16:59:07,370 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-12 16:59:09,398 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-12 16:59:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:12,430 INFO L93 Difference]: Finished difference Result 3008 states and 4053 transitions. [2022-07-12 16:59:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:12,431 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-12 16:59:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:12,439 INFO L225 Difference]: With dead ends: 3008 [2022-07-12 16:59:12,439 INFO L226 Difference]: Without dead ends: 3006 [2022-07-12 16:59:12,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:59:12,440 INFO L413 NwaCegarLoop]: 1385 mSDtfsCounter, 2179 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 2797 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 904 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:12,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 2797 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1331 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-12 16:59:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2022-07-12 16:59:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 3006. [2022-07-12 16:59:12,630 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-12 16:59:12,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3006 states to 3006 states and 4050 transitions. [2022-07-12 16:59:12,640 INFO L78 Accepts]: Start accepts. Automaton has 3006 states and 4050 transitions. Word has length 150 [2022-07-12 16:59:12,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:12,641 INFO L495 AbstractCegarLoop]: Abstraction has 3006 states and 4050 transitions. [2022-07-12 16:59:12,641 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-12 16:59:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3006 states and 4050 transitions. [2022-07-12 16:59:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 16:59:12,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:12,645 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-12 16:59:12,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 16:59:12,646 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-12 16:59:12,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:12,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1422462914, now seen corresponding path program 1 times [2022-07-12 16:59:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:12,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389025202] [2022-07-12 16:59:12,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:12,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:59:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:59:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:59:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:59:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:59:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:59:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:59:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:59:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:59:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:59:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:59:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:59:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:59:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:59:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:59:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:59:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:59:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 16:59:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 16:59:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 16:59:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 16:59:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:12,867 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-12 16:59:12,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:12,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389025202] [2022-07-12 16:59:12,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389025202] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:12,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:12,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387765492] [2022-07-12 16:59:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:12,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:12,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:12,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:12,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:12,870 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-12 16:59:14,896 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-12 16:59:16,917 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-12 16:59:21,024 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-12 16:59:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:22,247 INFO L93 Difference]: Finished difference Result 3006 states and 4050 transitions. [2022-07-12 16:59:22,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:22,248 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-12 16:59:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:22,255 INFO L225 Difference]: With dead ends: 3006 [2022-07-12 16:59:22,256 INFO L226 Difference]: Without dead ends: 3004 [2022-07-12 16:59:22,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:59:22,257 INFO L413 NwaCegarLoop]: 1383 mSDtfsCounter, 2173 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:22,258 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.2s Time] [2022-07-12 16:59:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2022-07-12 16:59:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 3004. [2022-07-12 16:59:22,380 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-12 16:59:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 4047 transitions. [2022-07-12 16:59:22,392 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 4047 transitions. Word has length 156 [2022-07-12 16:59:22,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:22,393 INFO L495 AbstractCegarLoop]: Abstraction has 3004 states and 4047 transitions. [2022-07-12 16:59:22,393 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-12 16:59:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 4047 transitions. [2022-07-12 16:59:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-12 16:59:22,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:22,397 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-12 16:59:22,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 16:59:22,398 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-12 16:59:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:22,398 INFO L85 PathProgramCache]: Analyzing trace with hash -274649241, now seen corresponding path program 1 times [2022-07-12 16:59:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:22,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900461908] [2022-07-12 16:59:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:59:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:59:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:59:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:59:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:59:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:59:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:59:22,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:59:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:59:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:59:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:59:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:59:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:59:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:59:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:59:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:59:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:59:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 16:59:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 16:59:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 16:59:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 16:59:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:59:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:22,626 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-12 16:59:22,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:22,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900461908] [2022-07-12 16:59:22,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900461908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:22,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:22,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:22,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652607464] [2022-07-12 16:59:22,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:22,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:22,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:22,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:22,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:22,630 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-12 16:59:24,655 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-12 16:59:26,680 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-12 16:59:30,928 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-12 16:59:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:32,130 INFO L93 Difference]: Finished difference Result 3004 states and 4047 transitions. [2022-07-12 16:59:32,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:32,130 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-12 16:59:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:32,137 INFO L225 Difference]: With dead ends: 3004 [2022-07-12 16:59:32,137 INFO L226 Difference]: Without dead ends: 3002 [2022-07-12 16:59:32,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:59:32,138 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:32,138 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.3s Time] [2022-07-12 16:59:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3002 states. [2022-07-12 16:59:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3002 to 3002. [2022-07-12 16:59:32,310 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-12 16:59:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 4044 transitions. [2022-07-12 16:59:32,322 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 4044 transitions. Word has length 162 [2022-07-12 16:59:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:32,322 INFO L495 AbstractCegarLoop]: Abstraction has 3002 states and 4044 transitions. [2022-07-12 16:59:32,323 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-12 16:59:32,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 4044 transitions. [2022-07-12 16:59:32,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-12 16:59:32,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:32,327 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-12 16:59:32,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 16:59:32,327 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-12 16:59:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:32,328 INFO L85 PathProgramCache]: Analyzing trace with hash -862924115, now seen corresponding path program 1 times [2022-07-12 16:59:32,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:32,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546777665] [2022-07-12 16:59:32,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:32,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:59:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:59:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:59:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:59:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:59:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:59:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:59:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:59:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:59:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:59:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:59:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:59:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:59:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:59:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:59:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:59:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:59:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 16:59:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 16:59:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 16:59:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 16:59:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:59:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 16:59:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:32,546 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-12 16:59:32,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:32,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546777665] [2022-07-12 16:59:32,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546777665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:32,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:32,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:32,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169741861] [2022-07-12 16:59:32,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:32,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:32,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:32,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:32,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:32,549 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-12 16:59:34,578 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-12 16:59:36,619 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-12 16:59:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:39,827 INFO L93 Difference]: Finished difference Result 3002 states and 4044 transitions. [2022-07-12 16:59:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:39,830 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-12 16:59:39,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:39,840 INFO L225 Difference]: With dead ends: 3002 [2022-07-12 16:59:39,841 INFO L226 Difference]: Without dead ends: 3000 [2022-07-12 16:59:39,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:59:39,843 INFO L413 NwaCegarLoop]: 1379 mSDtfsCounter, 2161 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 904 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s 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, 7.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:39,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2305 Valid, 2791 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [904 Valid, 1325 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-07-12 16:59:39,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2022-07-12 16:59:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 3000. [2022-07-12 16:59:39,987 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-12 16:59:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3000 states to 3000 states and 4041 transitions. [2022-07-12 16:59:39,995 INFO L78 Accepts]: Start accepts. Automaton has 3000 states and 4041 transitions. Word has length 168 [2022-07-12 16:59:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:39,995 INFO L495 AbstractCegarLoop]: Abstraction has 3000 states and 4041 transitions. [2022-07-12 16:59:39,996 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-12 16:59:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3000 states and 4041 transitions. [2022-07-12 16:59:39,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-12 16:59:40,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:40,000 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-12 16:59:40,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 16:59:40,000 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-12 16:59:40,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:40,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1586344965, now seen corresponding path program 1 times [2022-07-12 16:59:40,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:40,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875004951] [2022-07-12 16:59:40,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:40,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:59:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:59:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:59:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:59:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:59:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:59:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:59:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:59:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:59:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:59:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:59:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:59:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:59:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:59:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:59:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:59:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:59:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 16:59:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 16:59:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 16:59:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 16:59:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:59:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 16:59:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 16:59:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,228 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-12 16:59:40,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:40,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875004951] [2022-07-12 16:59:40,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875004951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:40,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:40,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:40,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152247452] [2022-07-12 16:59:40,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:40,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:40,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:40,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:40,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:40,230 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-12 16:59:42,258 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-12 16:59:44,292 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-12 16:59:48,235 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-12 16:59:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:49,324 INFO L93 Difference]: Finished difference Result 3000 states and 4041 transitions. [2022-07-12 16:59:49,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:49,325 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-12 16:59:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:49,334 INFO L225 Difference]: With dead ends: 3000 [2022-07-12 16:59:49,334 INFO L226 Difference]: Without dead ends: 2998 [2022-07-12 16:59:49,336 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-12 16:59:49,337 INFO L413 NwaCegarLoop]: 1377 mSDtfsCounter, 2155 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 904 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s 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.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:49,337 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.9s Time] [2022-07-12 16:59:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2022-07-12 16:59:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2998. [2022-07-12 16:59:49,524 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-12 16:59:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 4038 transitions. [2022-07-12 16:59:49,535 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 4038 transitions. Word has length 174 [2022-07-12 16:59:49,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:49,536 INFO L495 AbstractCegarLoop]: Abstraction has 2998 states and 4038 transitions. [2022-07-12 16:59:49,536 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-12 16:59:49,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 4038 transitions. [2022-07-12 16:59:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-07-12 16:59:49,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:49,542 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-12 16:59:49,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 16:59:49,542 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-12 16:59:49,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash 870548665, now seen corresponding path program 1 times [2022-07-12 16:59:49,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:49,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688489493] [2022-07-12 16:59:49,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:49,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 16:59:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 16:59:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-12 16:59:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 16:59:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 16:59:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 16:59:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 16:59:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 16:59:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 16:59:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-12 16:59:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 16:59:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 16:59:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 16:59:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 16:59:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 16:59:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 16:59:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 16:59:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 16:59:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 16:59:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 16:59:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 16:59:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 16:59:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 16:59:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 16:59:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 16:59:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 16:59:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:49,792 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-12 16:59:49,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:49,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688489493] [2022-07-12 16:59:49,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688489493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:49,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:49,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702336662] [2022-07-12 16:59:49,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:49,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:49,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:49,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:49,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:49,795 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)