./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--net--ethernet--smsc--smc91c92_cs.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.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 ebfa7940163335da607aa8ab46e2b4dcf0d50ad01772adcf05712684027181a0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 04:20:56,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 04:20:56,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 04:20:56,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 04:20:56,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 04:20:56,218 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 04:20:56,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 04:20:56,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 04:20:56,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 04:20:56,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 04:20:56,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 04:20:56,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 04:20:56,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 04:20:56,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 04:20:56,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 04:20:56,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 04:20:56,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 04:20:56,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 04:20:56,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 04:20:56,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 04:20:56,267 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 04:20:56,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 04:20:56,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 04:20:56,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 04:20:56,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 04:20:56,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 04:20:56,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 04:20:56,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 04:20:56,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 04:20:56,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 04:20:56,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 04:20:56,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 04:20:56,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 04:20:56,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 04:20:56,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 04:20:56,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 04:20:56,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 04:20:56,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 04:20:56,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 04:20:56,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 04:20:56,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 04:20:56,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 04:20:56,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 04:20:56,329 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 04:20:56,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 04:20:56,330 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 04:20:56,330 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 04:20:56,331 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 04:20:56,331 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 04:20:56,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 04:20:56,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 04:20:56,332 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 04:20:56,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 04:20:56,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 04:20:56,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 04:20:56,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 04:20:56,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 04:20:56,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 04:20:56,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 04:20:56,335 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 04:20:56,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 04:20:56,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 04:20:56,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 04:20:56,337 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 04:20:56,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:20:56,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 04:20:56,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 04:20:56,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 04:20:56,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 04:20:56,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 04:20:56,338 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 04:20:56,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 04:20:56,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 04:20:56,339 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 -> ebfa7940163335da607aa8ab46e2b4dcf0d50ad01772adcf05712684027181a0 [2022-07-23 04:20:56,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 04:20:56,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 04:20:56,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 04:20:56,623 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 04:20:56,624 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 04:20:56,625 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--net--ethernet--smsc--smc91c92_cs.ko.cil.i [2022-07-23 04:20:56,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15945f6bf/634f2cb2fe5b4864b3172996fd542886/FLAG190d30382 [2022-07-23 04:20:57,524 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 04:20:57,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i [2022-07-23 04:20:57,583 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15945f6bf/634f2cb2fe5b4864b3172996fd542886/FLAG190d30382 [2022-07-23 04:20:58,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15945f6bf/634f2cb2fe5b4864b3172996fd542886 [2022-07-23 04:20:58,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 04:20:58,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 04:20:58,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 04:20:58,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 04:20:58,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 04:20:58,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:20:58" (1/1) ... [2022-07-23 04:20:58,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21f3a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:20:58, skipping insertion in model container [2022-07-23 04:20:58,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:20:58" (1/1) ... [2022-07-23 04:20:58,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 04:20:58,233 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 04:21:02,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[424579,424592] [2022-07-23 04:21:02,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[424724,424737] [2022-07-23 04:21:02,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[424870,424883] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425035,425048] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425193,425206] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425351,425364] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425509,425522] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425669,425682] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425828,425841] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425967,425980] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426109,426122] [2022-07-23 04:21:02,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426258,426271] [2022-07-23 04:21:02,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426397,426410] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426552,426565] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426712,426725] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426863,426876] [2022-07-23 04:21:02,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427014,427027] [2022-07-23 04:21:02,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427166,427179] [2022-07-23 04:21:02,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427315,427328] [2022-07-23 04:21:02,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427463,427476] [2022-07-23 04:21:02,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427620,427633] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427769,427782] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427925,427938] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428078,428091] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428224,428237] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428367,428380] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428519,428532] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428665,428678] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428810,428823] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428964,428977] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429115,429128] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429270,429283] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429422,429435] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429577,429590] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429741,429754] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429897,429910] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430061,430074] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430203,430216] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430361,430374] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430528,430541] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430687,430700] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430846,430859] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430995,431008] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431142,431155] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431281,431294] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431444,431457] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431610,431623] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431774,431787] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431939,431952] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432104,432117] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432270,432283] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432435,432448] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432602,432615] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432762,432775] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432924,432937] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433083,433096] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433229,433242] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433372,433385] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433516,433529] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433659,433672] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433803,433816] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433944,433957] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434082,434095] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434240,434253] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434399,434412] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434555,434568] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434704,434717] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434856,434869] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435007,435020] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435156,435169] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435308,435321] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435456,435469] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435609,435622] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435760,435773] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435910,435923] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436057,436070] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436208,436221] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436359,436372] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436507,436520] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436673,436686] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436842,436855] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437009,437022] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437177,437190] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437327,437340] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437474,437487] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437635,437648] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437805,437818] [2022-07-23 04:21:02,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--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437967,437980] [2022-07-23 04:21:02,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:21:02,422 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 04:21:02,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[424579,424592] [2022-07-23 04:21:02,788 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[424724,424737] [2022-07-23 04:21:02,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[424870,424883] [2022-07-23 04:21:02,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425035,425048] [2022-07-23 04:21:02,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425193,425206] [2022-07-23 04:21:02,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425351,425364] [2022-07-23 04:21:02,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425509,425522] [2022-07-23 04:21:02,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425669,425682] [2022-07-23 04:21:02,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425828,425841] [2022-07-23 04:21:02,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[425967,425980] [2022-07-23 04:21:02,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426109,426122] [2022-07-23 04:21:02,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426258,426271] [2022-07-23 04:21:02,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426397,426410] [2022-07-23 04:21:02,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426552,426565] [2022-07-23 04:21:02,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426712,426725] [2022-07-23 04:21:02,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[426863,426876] [2022-07-23 04:21:02,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427014,427027] [2022-07-23 04:21:02,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427166,427179] [2022-07-23 04:21:02,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427315,427328] [2022-07-23 04:21:02,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427463,427476] [2022-07-23 04:21:02,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427620,427633] [2022-07-23 04:21:02,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427769,427782] [2022-07-23 04:21:02,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[427925,427938] [2022-07-23 04:21:02,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428078,428091] [2022-07-23 04:21:02,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428224,428237] [2022-07-23 04:21:02,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428367,428380] [2022-07-23 04:21:02,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428519,428532] [2022-07-23 04:21:02,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428665,428678] [2022-07-23 04:21:02,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428810,428823] [2022-07-23 04:21:02,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[428964,428977] [2022-07-23 04:21:02,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429115,429128] [2022-07-23 04:21:02,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429270,429283] [2022-07-23 04:21:02,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429422,429435] [2022-07-23 04:21:02,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429577,429590] [2022-07-23 04:21:02,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429741,429754] [2022-07-23 04:21:02,808 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[429897,429910] [2022-07-23 04:21:02,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430061,430074] [2022-07-23 04:21:02,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430203,430216] [2022-07-23 04:21:02,809 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430361,430374] [2022-07-23 04:21:02,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430528,430541] [2022-07-23 04:21:02,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430687,430700] [2022-07-23 04:21:02,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430846,430859] [2022-07-23 04:21:02,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[430995,431008] [2022-07-23 04:21:02,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431142,431155] [2022-07-23 04:21:02,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431281,431294] [2022-07-23 04:21:02,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431444,431457] [2022-07-23 04:21:02,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431610,431623] [2022-07-23 04:21:02,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431774,431787] [2022-07-23 04:21:02,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[431939,431952] [2022-07-23 04:21:02,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432104,432117] [2022-07-23 04:21:02,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432270,432283] [2022-07-23 04:21:02,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432435,432448] [2022-07-23 04:21:02,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432602,432615] [2022-07-23 04:21:02,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432762,432775] [2022-07-23 04:21:02,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[432924,432937] [2022-07-23 04:21:02,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433083,433096] [2022-07-23 04:21:02,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433229,433242] [2022-07-23 04:21:02,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433372,433385] [2022-07-23 04:21:02,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433516,433529] [2022-07-23 04:21:02,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433659,433672] [2022-07-23 04:21:02,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433803,433816] [2022-07-23 04:21:02,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[433944,433957] [2022-07-23 04:21:02,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434082,434095] [2022-07-23 04:21:02,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434240,434253] [2022-07-23 04:21:02,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434399,434412] [2022-07-23 04:21:02,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434555,434568] [2022-07-23 04:21:02,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434704,434717] [2022-07-23 04:21:02,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[434856,434869] [2022-07-23 04:21:02,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435007,435020] [2022-07-23 04:21:02,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435156,435169] [2022-07-23 04:21:02,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435308,435321] [2022-07-23 04:21:02,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435456,435469] [2022-07-23 04:21:02,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435609,435622] [2022-07-23 04:21:02,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435760,435773] [2022-07-23 04:21:02,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[435910,435923] [2022-07-23 04:21:02,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436057,436070] [2022-07-23 04:21:02,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436208,436221] [2022-07-23 04:21:02,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436359,436372] [2022-07-23 04:21:02,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436507,436520] [2022-07-23 04:21:02,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436673,436686] [2022-07-23 04:21:02,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[436842,436855] [2022-07-23 04:21:02,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437009,437022] [2022-07-23 04:21:02,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437177,437190] [2022-07-23 04:21:02,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437327,437340] [2022-07-23 04:21:02,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437474,437487] [2022-07-23 04:21:02,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437635,437648] [2022-07-23 04:21:02,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437805,437818] [2022-07-23 04:21:02,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i[437967,437980] [2022-07-23 04:21:02,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:21:03,115 INFO L208 MainTranslator]: Completed translation [2022-07-23 04:21:03,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:21:03 WrapperNode [2022-07-23 04:21:03,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 04:21:03,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 04:21:03,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 04:21:03,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 04:21:03,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:21:03" (1/1) ... [2022-07-23 04:21:03,293 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:21:03" (1/1) ... [2022-07-23 04:21:03,556 INFO L137 Inliner]: procedures = 621, calls = 2758, calls flagged for inlining = 280, calls inlined = 165, statements flattened = 4672 [2022-07-23 04:21:03,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 04:21:03,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 04:21:03,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 04:21:03,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 04:21:03,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:21:03" (1/1) ... [2022-07-23 04:21:03,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:21:03" (1/1) ... [2022-07-23 04:21:03,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:21:03" (1/1) ... [2022-07-23 04:21:03,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:21:03" (1/1) ... [2022-07-23 04:21:03,720 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:21:03" (1/1) ... [2022-07-23 04:21:03,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:21:03" (1/1) ... [2022-07-23 04:21:03,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:21:03" (1/1) ... [2022-07-23 04:21:03,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 04:21:03,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 04:21:03,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 04:21:03,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 04:21:03,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:21:03" (1/1) ... [2022-07-23 04:21:03,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:21:03,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:21:03,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 04:21:03,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 04:21:03,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:21:03,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:21:03,881 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_write [2022-07-23 04:21:03,881 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_write [2022-07-23 04:21:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure smc91c92_detach [2022-07-23 04:21:03,882 INFO L138 BoogieDeclarations]: Found implementation of procedure smc91c92_detach [2022-07-23 04:21:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-07-23 04:21:03,882 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-07-23 04:21:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure mhz_3288_power [2022-07-23 04:21:03,882 INFO L138 BoogieDeclarations]: Found implementation of procedure mhz_3288_power [2022-07-23 04:21:03,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 04:21:03,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 04:21:03,883 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_request_io [2022-07-23 04:21:03,883 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_request_io [2022-07-23 04:21:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:21:03,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:21:03,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:21:03,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-23 04:21:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:21:03,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:21:03,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_smc_private [2022-07-23 04:21:03,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_smc_private [2022-07-23 04:21:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:21:03,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:21:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-23 04:21:03,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-23 04:21:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-23 04:21:03,886 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-23 04:21:03,886 INFO L130 BoogieDeclarations]: Found specification of procedure smc91c92_resume [2022-07-23 04:21:03,887 INFO L138 BoogieDeclarations]: Found implementation of procedure smc91c92_resume [2022-07-23 04:21:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 04:21:03,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 04:21:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:21:03,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:21:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 04:21:03,887 INFO L130 BoogieDeclarations]: Found specification of procedure smc91c92_suspend [2022-07-23 04:21:03,888 INFO L138 BoogieDeclarations]: Found implementation of procedure smc91c92_suspend [2022-07-23 04:21:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:21:03,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:21:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-23 04:21:03,888 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-23 04:21:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev [2022-07-23 04:21:03,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev [2022-07-23 04:21:03,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 04:21:03,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 04:21:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:21:03,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:21:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 04:21:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:21:03,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:21:03,889 INFO L130 BoogieDeclarations]: Found specification of procedure set_rx_mode [2022-07-23 04:21:03,890 INFO L138 BoogieDeclarations]: Found implementation of procedure set_rx_mode [2022-07-23 04:21:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:21:03,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:21:03,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_interrupt_context [2022-07-23 04:21:03,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_interrupt_context [2022-07-23 04:21:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-23 04:21:03,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-23 04:21:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure cvt_ascii_address [2022-07-23 04:21:03,891 INFO L138 BoogieDeclarations]: Found implementation of procedure cvt_ascii_address [2022-07-23 04:21:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:21:03,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:21:03,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:21:03,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:21:03,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 04:21:03,892 INFO L130 BoogieDeclarations]: Found specification of procedure __bitrev8 [2022-07-23 04:21:03,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __bitrev8 [2022-07-23 04:21:03,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 04:21:03,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 04:21:03,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 04:21:03,892 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-23 04:21:03,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-23 04:21:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 04:21:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure smc_tx_timeout [2022-07-23 04:21:03,896 INFO L138 BoogieDeclarations]: Found implementation of procedure smc_tx_timeout [2022-07-23 04:21:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:21:03,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:21:03,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-07-23 04:21:03,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-07-23 04:21:03,897 INFO L130 BoogieDeclarations]: Found specification of procedure smc_reset [2022-07-23 04:21:03,897 INFO L138 BoogieDeclarations]: Found implementation of procedure smc_reset [2022-07-23 04:21:03,897 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-07-23 04:21:03,901 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-07-23 04:21:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_read [2022-07-23 04:21:03,902 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_read [2022-07-23 04:21:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 04:21:03,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 04:21:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 04:21:03,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 04:21:03,902 INFO L130 BoogieDeclarations]: Found specification of procedure smc_hardware_send_packet [2022-07-23 04:21:03,902 INFO L138 BoogieDeclarations]: Found implementation of procedure smc_hardware_send_packet [2022-07-23 04:21:03,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:21:03,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-23 04:21:03,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_switch_to_process_context [2022-07-23 04:21:03,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_switch_to_process_context [2022-07-23 04:21:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_130 [2022-07-23 04:21:03,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_130 [2022-07-23 04:21:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure osi_load_firmware [2022-07-23 04:21:03,904 INFO L138 BoogieDeclarations]: Found implementation of procedure osi_load_firmware [2022-07-23 04:21:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-23 04:21:03,904 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-23 04:21:03,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:21:03,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:21:03,905 INFO L130 BoogieDeclarations]: Found specification of procedure smc_set_xcvr [2022-07-23 04:21:03,905 INFO L138 BoogieDeclarations]: Found implementation of procedure smc_set_xcvr [2022-07-23 04:21:03,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:21:03,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:21:03,905 INFO L130 BoogieDeclarations]: Found specification of procedure netif_start_queue [2022-07-23 04:21:03,905 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_start_queue [2022-07-23 04:21:03,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 04:21:03,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:21:03,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:21:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure netif_running [2022-07-23 04:21:03,906 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_running [2022-07-23 04:21:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 04:21:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-23 04:21:03,906 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-23 04:21:03,906 INFO L130 BoogieDeclarations]: Found specification of procedure mot_config [2022-07-23 04:21:03,906 INFO L138 BoogieDeclarations]: Found implementation of procedure mot_config [2022-07-23 04:21:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 04:21:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:21:03,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:21:03,907 INFO L130 BoogieDeclarations]: Found specification of procedure check_sig [2022-07-23 04:21:03,908 INFO L138 BoogieDeclarations]: Found implementation of procedure check_sig [2022-07-23 04:21:03,908 INFO L130 BoogieDeclarations]: Found specification of procedure outw [2022-07-23 04:21:03,908 INFO L138 BoogieDeclarations]: Found implementation of procedure outw [2022-07-23 04:21:03,908 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-23 04:21:03,908 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-23 04:21:03,908 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2022-07-23 04:21:03,908 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2022-07-23 04:21:03,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 04:21:03,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 04:21:03,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_smc_private [2022-07-23 04:21:03,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_smc_private [2022-07-23 04:21:03,909 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_irq [2022-07-23 04:21:03,909 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_irq [2022-07-23 04:21:03,909 INFO L130 BoogieDeclarations]: Found specification of procedure mdio_sync [2022-07-23 04:21:03,909 INFO L138 BoogieDeclarations]: Found implementation of procedure mdio_sync [2022-07-23 04:21:03,909 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:21:03,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:21:03,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:21:03,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:21:03,910 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-23 04:21:03,910 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-23 04:21:03,910 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-23 04:21:03,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-23 04:21:03,910 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-23 04:21:03,910 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-23 04:21:03,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:21:03,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:21:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 04:21:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:21:03,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:21:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure __bitrev16 [2022-07-23 04:21:03,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __bitrev16 [2022-07-23 04:21:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_loop_tuple [2022-07-23 04:21:03,911 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_loop_tuple [2022-07-23 04:21:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure smc91c92_release [2022-07-23 04:21:03,912 INFO L138 BoogieDeclarations]: Found implementation of procedure smc91c92_release [2022-07-23 04:21:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 04:21:03,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 04:21:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:21:03,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:21:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure pcmcia_loop_config [2022-07-23 04:21:03,912 INFO L138 BoogieDeclarations]: Found implementation of procedure pcmcia_loop_config [2022-07-23 04:21:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-23 04:21:03,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-23 04:21:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:21:03,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:21:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2022-07-23 04:21:03,913 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2022-07-23 04:21:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 04:21:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure inw [2022-07-23 04:21:03,914 INFO L138 BoogieDeclarations]: Found implementation of procedure inw [2022-07-23 04:21:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-07-23 04:21:03,914 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-07-23 04:21:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2022-07-23 04:21:03,914 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2022-07-23 04:21:04,524 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 04:21:04,526 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 04:21:04,736 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 04:21:10,734 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 04:21:10,762 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 04:21:10,762 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 04:21:10,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:21:10 BoogieIcfgContainer [2022-07-23 04:21:10,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 04:21:10,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 04:21:10,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 04:21:10,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 04:21:10,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 04:20:58" (1/3) ... [2022-07-23 04:21:10,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17893a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:21:10, skipping insertion in model container [2022-07-23 04:21:10,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:21:03" (2/3) ... [2022-07-23 04:21:10,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17893a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:21:10, skipping insertion in model container [2022-07-23 04:21:10,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:21:10" (3/3) ... [2022-07-23 04:21:10,780 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--net--ethernet--smsc--smc91c92_cs.ko.cil.i [2022-07-23 04:21:10,795 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 04:21:10,795 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2022-07-23 04:21:10,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 04:21:10,899 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@593aa2fc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48478cf7 [2022-07-23 04:21:10,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2022-07-23 04:21:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 1397 states, 912 states have (on average 1.2883771929824561) internal successors, (1175), 957 states have internal predecessors, (1175), 378 states have call successors, (378), 83 states have call predecessors, (378), 82 states have return successors, (374), 371 states have call predecessors, (374), 374 states have call successors, (374) [2022-07-23 04:21:10,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 04:21:10,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:10,927 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-23 04:21:10,928 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 22 more)] === [2022-07-23 04:21:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:10,933 INFO L85 PathProgramCache]: Analyzing trace with hash 590792471, now seen corresponding path program 1 times [2022-07-23 04:21:10,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:10,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636220544] [2022-07-23 04:21:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:10,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:11,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:12,207 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-23 04:21:12,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:12,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636220544] [2022-07-23 04:21:12,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636220544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:12,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:12,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13514807] [2022-07-23 04:21:12,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:12,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:12,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:12,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:12,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:12,252 INFO L87 Difference]: Start difference. First operand has 1397 states, 912 states have (on average 1.2883771929824561) internal successors, (1175), 957 states have internal predecessors, (1175), 378 states have call successors, (378), 83 states have call predecessors, (378), 82 states have return successors, (374), 371 states have call predecessors, (374), 374 states have call successors, (374) 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-23 04:21:14,335 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:21:16,363 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-23 04:21:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:23,711 INFO L93 Difference]: Finished difference Result 4137 states and 5857 transitions. [2022-07-23 04:21:23,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:21:23,714 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-23 04:21:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:23,752 INFO L225 Difference]: With dead ends: 4137 [2022-07-23 04:21:23,752 INFO L226 Difference]: Without dead ends: 2741 [2022-07-23 04:21:23,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 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-23 04:21:23,767 INFO L413 NwaCegarLoop]: 1962 mSDtfsCounter, 3553 mSDsluCounter, 2721 mSDsCounter, 0 mSdLazyCounter, 3763 mSolverCounterSat, 2469 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3753 SdHoareTripleChecker+Valid, 4683 SdHoareTripleChecker+Invalid, 6234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2469 IncrementalHoareTripleChecker+Valid, 3763 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:23,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3753 Valid, 4683 Invalid, 6234 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2469 Valid, 3763 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2022-07-23 04:21:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2741 states. [2022-07-23 04:21:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2741 to 2560. [2022-07-23 04:21:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 1689 states have (on average 1.2504440497335703) internal successors, (2112), 1751 states have internal predecessors, (2112), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:21:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3519 transitions. [2022-07-23 04:21:24,096 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3519 transitions. Word has length 64 [2022-07-23 04:21:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:24,097 INFO L495 AbstractCegarLoop]: Abstraction has 2560 states and 3519 transitions. [2022-07-23 04:21:24,097 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-23 04:21:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3519 transitions. [2022-07-23 04:21:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 04:21:24,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:24,100 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-23 04:21:24,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 04:21:24,101 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 22 more)] === [2022-07-23 04:21:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2012828021, now seen corresponding path program 1 times [2022-07-23 04:21:24,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:24,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323952046] [2022-07-23 04:21:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:24,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:24,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:24,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:24,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:24,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:24,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:24,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:24,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:24,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:24,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:24,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:24,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:24,744 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-23 04:21:24,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:24,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323952046] [2022-07-23 04:21:24,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323952046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:24,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:24,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:24,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979230704] [2022-07-23 04:21:24,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:24,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:24,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:24,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:24,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:24,748 INFO L87 Difference]: Start difference. First operand 2560 states and 3519 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-23 04:21:26,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:21:28,829 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-23 04:21:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:32,241 INFO L93 Difference]: Finished difference Result 2560 states and 3519 transitions. [2022-07-23 04:21:32,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:32,242 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-23 04:21:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:32,258 INFO L225 Difference]: With dead ends: 2560 [2022-07-23 04:21:32,258 INFO L226 Difference]: Without dead ends: 2558 [2022-07-23 04:21:32,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:21:32,264 INFO L413 NwaCegarLoop]: 1704 mSDtfsCounter, 2433 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2632 SdHoareTripleChecker+Valid, 3603 SdHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:32,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2632 Valid, 3603 Invalid, 3083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1679 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-07-23 04:21:32,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2022-07-23 04:21:32,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2022-07-23 04:21:32,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 1688 states have (on average 1.25) internal successors, (2110), 1749 states have internal predecessors, (2110), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:21:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3517 transitions. [2022-07-23 04:21:32,378 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3517 transitions. Word has length 70 [2022-07-23 04:21:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:32,380 INFO L495 AbstractCegarLoop]: Abstraction has 2558 states and 3517 transitions. [2022-07-23 04:21:32,381 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-23 04:21:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3517 transitions. [2022-07-23 04:21:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 04:21:32,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:32,388 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-23 04:21:32,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 04:21:32,389 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 22 more)] === [2022-07-23 04:21:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1603005742, now seen corresponding path program 1 times [2022-07-23 04:21:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:32,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173204651] [2022-07-23 04:21:32,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:32,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:32,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:32,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:32,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:32,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:32,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:32,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:32,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:32,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:32,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:32,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:32,936 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-23 04:21:32,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:32,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173204651] [2022-07-23 04:21:32,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173204651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:32,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:32,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:32,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773044916] [2022-07-23 04:21:32,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:32,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:32,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:32,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:32,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:32,939 INFO L87 Difference]: Start difference. First operand 2558 states and 3517 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-23 04:21:34,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:21:37,007 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-23 04:21:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:40,337 INFO L93 Difference]: Finished difference Result 2558 states and 3517 transitions. [2022-07-23 04:21:40,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:40,338 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-23 04:21:40,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:40,353 INFO L225 Difference]: With dead ends: 2558 [2022-07-23 04:21:40,353 INFO L226 Difference]: Without dead ends: 2556 [2022-07-23 04:21:40,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:21:40,357 INFO L413 NwaCegarLoop]: 1702 mSDtfsCounter, 2427 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:40,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2625 Valid, 3601 Invalid, 3081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1677 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-07-23 04:21:40,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-23 04:21:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2556. [2022-07-23 04:21:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2556 states, 1687 states have (on average 1.2495554238292828) internal successors, (2108), 1747 states have internal predecessors, (2108), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:21:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2556 states to 2556 states and 3515 transitions. [2022-07-23 04:21:40,473 INFO L78 Accepts]: Start accepts. Automaton has 2556 states and 3515 transitions. Word has length 76 [2022-07-23 04:21:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:40,474 INFO L495 AbstractCegarLoop]: Abstraction has 2556 states and 3515 transitions. [2022-07-23 04:21:40,475 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-23 04:21:40,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2556 states and 3515 transitions. [2022-07-23 04:21:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-23 04:21:40,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:40,477 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-23 04:21:40,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 04:21:40,477 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 22 more)] === [2022-07-23 04:21:40,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1583848173, now seen corresponding path program 1 times [2022-07-23 04:21:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:40,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594931344] [2022-07-23 04:21:40,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:40,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:40,991 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-23 04:21:40,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:40,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594931344] [2022-07-23 04:21:40,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594931344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:40,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:40,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:40,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280346419] [2022-07-23 04:21:40,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:40,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:40,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:40,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:40,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:40,994 INFO L87 Difference]: Start difference. First operand 2556 states and 3515 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-23 04:21:43,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:21:45,062 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-23 04:21:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:48,290 INFO L93 Difference]: Finished difference Result 2556 states and 3515 transitions. [2022-07-23 04:21:48,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:48,291 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-23 04:21:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:48,304 INFO L225 Difference]: With dead ends: 2556 [2022-07-23 04:21:48,304 INFO L226 Difference]: Without dead ends: 2554 [2022-07-23 04:21:48,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:21:48,306 INFO L413 NwaCegarLoop]: 1700 mSDtfsCounter, 2421 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2618 SdHoareTripleChecker+Valid, 3599 SdHoareTripleChecker+Invalid, 3079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:48,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2618 Valid, 3599 Invalid, 3079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1675 Invalid, 2 Unknown, 0 Unchecked, 7.1s Time] [2022-07-23 04:21:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2022-07-23 04:21:48,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2554. [2022-07-23 04:21:48,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 1686 states have (on average 1.2491103202846976) internal successors, (2106), 1745 states have internal predecessors, (2106), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:21:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3513 transitions. [2022-07-23 04:21:48,412 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3513 transitions. Word has length 82 [2022-07-23 04:21:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:48,412 INFO L495 AbstractCegarLoop]: Abstraction has 2554 states and 3513 transitions. [2022-07-23 04:21:48,413 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-23 04:21:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3513 transitions. [2022-07-23 04:21:48,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 04:21:48,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:48,414 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-23 04:21:48,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 04:21:48,415 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 22 more)] === [2022-07-23 04:21:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:48,415 INFO L85 PathProgramCache]: Analyzing trace with hash 51375118, now seen corresponding path program 1 times [2022-07-23 04:21:48,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:48,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019894266] [2022-07-23 04:21:48,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:48,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:48,853 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-23 04:21:48,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:48,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019894266] [2022-07-23 04:21:48,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019894266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:48,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:48,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:48,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015717154] [2022-07-23 04:21:48,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:48,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:48,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:48,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:48,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:48,857 INFO L87 Difference]: Start difference. First operand 2554 states and 3513 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-23 04:21:50,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:21:52,927 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-23 04:21:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:21:55,625 INFO L93 Difference]: Finished difference Result 2554 states and 3513 transitions. [2022-07-23 04:21:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:21:55,626 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-23 04:21:55,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:21:55,639 INFO L225 Difference]: With dead ends: 2554 [2022-07-23 04:21:55,639 INFO L226 Difference]: Without dead ends: 2552 [2022-07-23 04:21:55,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:21:55,641 INFO L413 NwaCegarLoop]: 1698 mSDtfsCounter, 2415 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1673 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2611 SdHoareTripleChecker+Valid, 3597 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1673 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:21:55,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2611 Valid, 3597 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1673 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-23 04:21:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2022-07-23 04:21:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2552. [2022-07-23 04:21:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 1685 states have (on average 1.2486646884272996) internal successors, (2104), 1743 states have internal predecessors, (2104), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:21:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3511 transitions. [2022-07-23 04:21:55,751 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3511 transitions. Word has length 88 [2022-07-23 04:21:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:21:55,753 INFO L495 AbstractCegarLoop]: Abstraction has 2552 states and 3511 transitions. [2022-07-23 04:21:55,753 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-23 04:21:55,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3511 transitions. [2022-07-23 04:21:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-23 04:21:55,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:21:55,761 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-23 04:21:55,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 04:21:55,762 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 22 more)] === [2022-07-23 04:21:55,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:21:55,762 INFO L85 PathProgramCache]: Analyzing trace with hash 817977721, now seen corresponding path program 1 times [2022-07-23 04:21:55,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:21:55,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798181433] [2022-07-23 04:21:55,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:21:55,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:21:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:21:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:21:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:21:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:21:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:21:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:21:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:21:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:21:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:21:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:21:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:21:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:21:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:21:56,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:21:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:21:56,343 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-23 04:21:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:21:56,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798181433] [2022-07-23 04:21:56,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798181433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:21:56,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:21:56,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:21:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828199777] [2022-07-23 04:21:56,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:21:56,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:21:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:21:56,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:21:56,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:21:56,346 INFO L87 Difference]: Start difference. First operand 2552 states and 3511 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-23 04:21:58,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:22:00,424 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-23 04:22:03,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:03,007 INFO L93 Difference]: Finished difference Result 2552 states and 3511 transitions. [2022-07-23 04:22:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:22:03,007 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-23 04:22:03,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:03,022 INFO L225 Difference]: With dead ends: 2552 [2022-07-23 04:22:03,022 INFO L226 Difference]: Without dead ends: 2550 [2022-07-23 04:22:03,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:22:03,026 INFO L413 NwaCegarLoop]: 1696 mSDtfsCounter, 2409 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2604 SdHoareTripleChecker+Valid, 3595 SdHoareTripleChecker+Invalid, 3075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:03,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2604 Valid, 3595 Invalid, 3075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1671 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-07-23 04:22:03,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2022-07-23 04:22:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2550. [2022-07-23 04:22:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 1684 states have (on average 1.2482185273159145) internal successors, (2102), 1741 states have internal predecessors, (2102), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:22:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 3509 transitions. [2022-07-23 04:22:03,186 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 3509 transitions. Word has length 94 [2022-07-23 04:22:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:03,186 INFO L495 AbstractCegarLoop]: Abstraction has 2550 states and 3509 transitions. [2022-07-23 04:22:03,186 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-23 04:22:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 3509 transitions. [2022-07-23 04:22:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-23 04:22:03,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:03,188 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-23 04:22:03,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 04:22:03,188 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 22 more)] === [2022-07-23 04:22:03,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2102210251, now seen corresponding path program 1 times [2022-07-23 04:22:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:03,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328649794] [2022-07-23 04:22:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:22:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:22:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:22:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:22:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:22:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:22:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:22:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:22:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:22:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:22:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:03,636 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-23 04:22:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:03,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328649794] [2022-07-23 04:22:03,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328649794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:03,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:03,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:22:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458923260] [2022-07-23 04:22:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:03,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:22:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:22:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:22:03,639 INFO L87 Difference]: Start difference. First operand 2550 states and 3509 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-23 04:22:05,684 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-23 04:22:07,701 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-23 04:22:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:10,232 INFO L93 Difference]: Finished difference Result 2550 states and 3509 transitions. [2022-07-23 04:22:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:22:10,232 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-23 04:22:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:10,242 INFO L225 Difference]: With dead ends: 2550 [2022-07-23 04:22:10,242 INFO L226 Difference]: Without dead ends: 2548 [2022-07-23 04:22:10,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:22:10,244 INFO L413 NwaCegarLoop]: 1694 mSDtfsCounter, 2403 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2597 SdHoareTripleChecker+Valid, 3593 SdHoareTripleChecker+Invalid, 3073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:10,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2597 Valid, 3593 Invalid, 3073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1669 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-07-23 04:22:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2022-07-23 04:22:10,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2548. [2022-07-23 04:22:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 1683 states have (on average 1.2477718360071302) internal successors, (2100), 1739 states have internal predecessors, (2100), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:22:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3507 transitions. [2022-07-23 04:22:10,381 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3507 transitions. Word has length 100 [2022-07-23 04:22:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:10,381 INFO L495 AbstractCegarLoop]: Abstraction has 2548 states and 3507 transitions. [2022-07-23 04:22:10,381 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-23 04:22:10,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3507 transitions. [2022-07-23 04:22:10,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-23 04:22:10,383 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:10,383 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-23 04:22:10,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 04:22:10,384 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 22 more)] === [2022-07-23 04:22:10,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:10,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1247008982, now seen corresponding path program 1 times [2022-07-23 04:22:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:10,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252964707] [2022-07-23 04:22:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:10,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:22:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:22:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:22:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:22:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:22:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:22:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:22:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:22:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:22:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:22:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:10,905 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-23 04:22:10,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:10,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252964707] [2022-07-23 04:22:10,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252964707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:10,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:10,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:22:10,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170447977] [2022-07-23 04:22:10,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:10,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:22:10,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:10,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:22:10,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:22:10,908 INFO L87 Difference]: Start difference. First operand 2548 states and 3507 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-23 04:22:12,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:22:14,996 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-23 04:22:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:18,463 INFO L93 Difference]: Finished difference Result 2548 states and 3507 transitions. [2022-07-23 04:22:18,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:22:18,464 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-23 04:22:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:18,475 INFO L225 Difference]: With dead ends: 2548 [2022-07-23 04:22:18,475 INFO L226 Difference]: Without dead ends: 2546 [2022-07-23 04:22:18,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:22:18,478 INFO L413 NwaCegarLoop]: 1692 mSDtfsCounter, 2401 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2594 SdHoareTripleChecker+Valid, 3591 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:18,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2594 Valid, 3591 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1663 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-07-23 04:22:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2022-07-23 04:22:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2546. [2022-07-23 04:22:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 1682 states have (on average 1.2473246135552913) internal successors, (2098), 1737 states have internal predecessors, (2098), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:22:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3505 transitions. [2022-07-23 04:22:18,634 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3505 transitions. Word has length 106 [2022-07-23 04:22:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:18,635 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 3505 transitions. [2022-07-23 04:22:18,635 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-23 04:22:18,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3505 transitions. [2022-07-23 04:22:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-23 04:22:18,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:18,637 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-23 04:22:18,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 04:22:18,638 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 22 more)] === [2022-07-23 04:22:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash -79612083, now seen corresponding path program 1 times [2022-07-23 04:22:18,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:18,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905582156] [2022-07-23 04:22:18,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:18,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:18,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:18,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:18,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:22:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:22:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:22:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:22:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:22:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:22:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:22:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:22:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:22:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:22:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:19,123 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-23 04:22:19,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:19,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905582156] [2022-07-23 04:22:19,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905582156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:19,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:19,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:22:19,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409997255] [2022-07-23 04:22:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:19,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:22:19,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:19,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:22:19,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:22:19,127 INFO L87 Difference]: Start difference. First operand 2546 states and 3505 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-23 04:22:21,195 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:22:23,206 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-23 04:22:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:26,554 INFO L93 Difference]: Finished difference Result 2546 states and 3505 transitions. [2022-07-23 04:22:26,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:22:26,555 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-23 04:22:26,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:26,565 INFO L225 Difference]: With dead ends: 2546 [2022-07-23 04:22:26,565 INFO L226 Difference]: Without dead ends: 2544 [2022-07-23 04:22:26,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:22:26,567 INFO L413 NwaCegarLoop]: 1690 mSDtfsCounter, 2389 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 3589 SdHoareTripleChecker+Invalid, 3069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:26,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 3589 Invalid, 3069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1665 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-07-23 04:22:26,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2022-07-23 04:22:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2022-07-23 04:22:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 1681 states have (on average 1.2468768590124926) internal successors, (2096), 1735 states have internal predecessors, (2096), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:22:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3503 transitions. [2022-07-23 04:22:26,680 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3503 transitions. Word has length 108 [2022-07-23 04:22:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:26,681 INFO L495 AbstractCegarLoop]: Abstraction has 2544 states and 3503 transitions. [2022-07-23 04:22:26,682 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-23 04:22:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3503 transitions. [2022-07-23 04:22:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-23 04:22:26,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:26,684 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-23 04:22:26,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 04:22:26,685 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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 22 more)] === [2022-07-23 04:22:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash -953063554, now seen corresponding path program 1 times [2022-07-23 04:22:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:26,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333281878] [2022-07-23 04:22:26,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:26,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:26,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:22:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:22:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:22:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:22:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:22:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:22:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:22:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:22:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:22:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:22:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:22:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:27,122 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-23 04:22:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:27,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333281878] [2022-07-23 04:22:27,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333281878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:27,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:27,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:22:27,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113751741] [2022-07-23 04:22:27,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:27,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:22:27,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:27,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:22:27,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:22:27,124 INFO L87 Difference]: Start difference. First operand 2544 states and 3503 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-23 04:22:29,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:22:31,205 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-23 04:22:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:34,002 INFO L93 Difference]: Finished difference Result 2544 states and 3503 transitions. [2022-07-23 04:22:34,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:22:34,008 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-23 04:22:34,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:34,039 INFO L225 Difference]: With dead ends: 2544 [2022-07-23 04:22:34,039 INFO L226 Difference]: Without dead ends: 2542 [2022-07-23 04:22:34,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:22:34,043 INFO L413 NwaCegarLoop]: 1688 mSDtfsCounter, 2385 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2577 SdHoareTripleChecker+Valid, 3587 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:34,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2577 Valid, 3587 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1663 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-07-23 04:22:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2022-07-23 04:22:34,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2022-07-23 04:22:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 1680 states have (on average 1.2464285714285714) internal successors, (2094), 1733 states have internal predecessors, (2094), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:22:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 3501 transitions. [2022-07-23 04:22:34,186 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 3501 transitions. Word has length 114 [2022-07-23 04:22:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:34,187 INFO L495 AbstractCegarLoop]: Abstraction has 2542 states and 3501 transitions. [2022-07-23 04:22:34,187 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-23 04:22:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 3501 transitions. [2022-07-23 04:22:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-23 04:22:34,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:34,189 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-23 04:22:34,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 04:22:34,190 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 22 more)] === [2022-07-23 04:22:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:34,191 INFO L85 PathProgramCache]: Analyzing trace with hash 480083321, now seen corresponding path program 1 times [2022-07-23 04:22:34,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:34,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144752738] [2022-07-23 04:22:34,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:34,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:22:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:22:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:22:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:22:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:22:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:22:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:22:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:22:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:22:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:22:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:22:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:22:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:34,721 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-23 04:22:34,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:34,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144752738] [2022-07-23 04:22:34,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144752738] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:34,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:34,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:22:34,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924837072] [2022-07-23 04:22:34,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:34,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:22:34,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:34,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:22:34,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:22:34,725 INFO L87 Difference]: Start difference. First operand 2542 states and 3501 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-23 04:22:36,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:22:38,800 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-23 04:22:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:41,260 INFO L93 Difference]: Finished difference Result 2542 states and 3501 transitions. [2022-07-23 04:22:41,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:22:41,261 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-23 04:22:41,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:41,270 INFO L225 Difference]: With dead ends: 2542 [2022-07-23 04:22:41,270 INFO L226 Difference]: Without dead ends: 2540 [2022-07-23 04:22:41,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:22:41,272 INFO L413 NwaCegarLoop]: 1686 mSDtfsCounter, 2379 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2570 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 3065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:41,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2570 Valid, 3585 Invalid, 3065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1661 Invalid, 2 Unknown, 0 Unchecked, 6.4s Time] [2022-07-23 04:22:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2022-07-23 04:22:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2540. [2022-07-23 04:22:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 1679 states have (on average 1.2459797498511018) internal successors, (2092), 1731 states have internal predecessors, (2092), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:22:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3499 transitions. [2022-07-23 04:22:41,444 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3499 transitions. Word has length 120 [2022-07-23 04:22:41,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:41,447 INFO L495 AbstractCegarLoop]: Abstraction has 2540 states and 3499 transitions. [2022-07-23 04:22:41,447 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-23 04:22:41,447 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3499 transitions. [2022-07-23 04:22:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-23 04:22:41,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:41,449 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-23 04:22:41,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 04:22:41,450 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 22 more)] === [2022-07-23 04:22:41,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:41,450 INFO L85 PathProgramCache]: Analyzing trace with hash -321350871, now seen corresponding path program 1 times [2022-07-23 04:22:41,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:41,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509331889] [2022-07-23 04:22:41,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:41,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:22:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:22:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:22:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:22:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:22:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:22:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:22:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:22:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:22:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:22:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:22:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:22:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:22:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:41,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-23 04:22:41,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:41,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509331889] [2022-07-23 04:22:41,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509331889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:41,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:41,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:22:41,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128742272] [2022-07-23 04:22:41,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:41,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:22:41,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:41,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:22:41,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:22:41,870 INFO L87 Difference]: Start difference. First operand 2540 states and 3499 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-23 04:22:43,924 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:22:45,943 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-23 04:22:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:48,354 INFO L93 Difference]: Finished difference Result 2540 states and 3499 transitions. [2022-07-23 04:22:48,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:22:48,355 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-23 04:22:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:48,364 INFO L225 Difference]: With dead ends: 2540 [2022-07-23 04:22:48,365 INFO L226 Difference]: Without dead ends: 2538 [2022-07-23 04:22:48,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:22:48,366 INFO L413 NwaCegarLoop]: 1684 mSDtfsCounter, 2373 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1659 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2563 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 3063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1659 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:48,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2563 Valid, 3583 Invalid, 3063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1659 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-07-23 04:22:48,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-07-23 04:22:48,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-07-23 04:22:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 1678 states have (on average 1.2455303933253874) internal successors, (2090), 1729 states have internal predecessors, (2090), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:22:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3497 transitions. [2022-07-23 04:22:48,484 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3497 transitions. Word has length 126 [2022-07-23 04:22:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:48,485 INFO L495 AbstractCegarLoop]: Abstraction has 2538 states and 3497 transitions. [2022-07-23 04:22:48,485 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-23 04:22:48,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3497 transitions. [2022-07-23 04:22:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-23 04:22:48,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:48,487 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-23 04:22:48,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 04:22:48,488 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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 22 more)] === [2022-07-23 04:22:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:48,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1610445211, now seen corresponding path program 1 times [2022-07-23 04:22:48,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:48,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294182029] [2022-07-23 04:22:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:48,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:22:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:22:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:22:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:48,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:22:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:22:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:22:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:22:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:22:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:22:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:22:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:22:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:22:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:22:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:22:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:22:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:22:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:48,922 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-23 04:22:48,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:48,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294182029] [2022-07-23 04:22:48,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294182029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:48,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:48,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:22:48,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648041923] [2022-07-23 04:22:48,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:48,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:22:48,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:48,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:22:48,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:22:48,925 INFO L87 Difference]: Start difference. First operand 2538 states and 3497 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-23 04:22:50,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:22:52,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:22:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:22:56,079 INFO L93 Difference]: Finished difference Result 2538 states and 3497 transitions. [2022-07-23 04:22:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:22:56,079 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-23 04:22:56,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:22:56,089 INFO L225 Difference]: With dead ends: 2538 [2022-07-23 04:22:56,089 INFO L226 Difference]: Without dead ends: 2536 [2022-07-23 04:22:56,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:22:56,092 INFO L413 NwaCegarLoop]: 1682 mSDtfsCounter, 2367 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 3581 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:22:56,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 3581 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1657 Invalid, 2 Unknown, 0 Unchecked, 6.9s Time] [2022-07-23 04:22:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2022-07-23 04:22:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2536. [2022-07-23 04:22:56,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2536 states, 1677 states have (on average 1.2450805008944543) internal successors, (2088), 1727 states have internal predecessors, (2088), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:22:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2536 states to 2536 states and 3495 transitions. [2022-07-23 04:22:56,231 INFO L78 Accepts]: Start accepts. Automaton has 2536 states and 3495 transitions. Word has length 132 [2022-07-23 04:22:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:22:56,231 INFO L495 AbstractCegarLoop]: Abstraction has 2536 states and 3495 transitions. [2022-07-23 04:22:56,231 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-23 04:22:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2536 states and 3495 transitions. [2022-07-23 04:22:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-23 04:22:56,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:22:56,234 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:22:56,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 04:22:56,234 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-23 04:22:56,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:22:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1095281589, now seen corresponding path program 1 times [2022-07-23 04:22:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:22:56,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524255699] [2022-07-23 04:22:56,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:22:56,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:22:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:22:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:22:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:22:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:22:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:56,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:56,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:22:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:22:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:22:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:22:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:22:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:22:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:22:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:56,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:22:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:57,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-23 04:22:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:22:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:57,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:22:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:57,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-23 04:22:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:57,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:22:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:22:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-23 04:22:57,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:22:57,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524255699] [2022-07-23 04:22:57,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524255699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:22:57,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:22:57,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 04:22:57,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576124949] [2022-07-23 04:22:57,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:22:57,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 04:22:57,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:22:57,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 04:22:57,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 04:22:57,053 INFO L87 Difference]: Start difference. First operand 2536 states and 3495 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:22:59,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:23:02,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:23:02,649 INFO L93 Difference]: Finished difference Result 5081 states and 7010 transitions. [2022-07-23 04:23:02,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 04:23:02,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 3 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 142 [2022-07-23 04:23:02,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:23:02,662 INFO L225 Difference]: With dead ends: 5081 [2022-07-23 04:23:02,662 INFO L226 Difference]: Without dead ends: 2564 [2022-07-23 04:23:02,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 04:23:02,671 INFO L413 NwaCegarLoop]: 1761 mSDtfsCounter, 380 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 375 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 3591 SdHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:23:02,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 3591 Invalid, 1512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 1136 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2022-07-23 04:23:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2022-07-23 04:23:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2538. [2022-07-23 04:23:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 1679 states have (on average 1.2447885646217987) internal successors, (2090), 1729 states have internal predecessors, (2090), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:23:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3497 transitions. [2022-07-23 04:23:02,843 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3497 transitions. Word has length 142 [2022-07-23 04:23:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:23:02,843 INFO L495 AbstractCegarLoop]: Abstraction has 2538 states and 3497 transitions. [2022-07-23 04:23:02,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:23:02,844 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3497 transitions. [2022-07-23 04:23:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-23 04:23:02,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:23:02,846 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:23:02,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 04:23:02,847 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-23 04:23:02,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:23:02,847 INFO L85 PathProgramCache]: Analyzing trace with hash -961268083, now seen corresponding path program 1 times [2022-07-23 04:23:02,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:23:02,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792842628] [2022-07-23 04:23:02,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:23:02,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:23:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:23:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:23:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:23:03,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:23:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:23:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:23:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:23:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:23:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-23 04:23:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:23:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:23:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-23 04:23:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:23:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-23 04:23:03,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:23:03,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792842628] [2022-07-23 04:23:03,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792842628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:23:03,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:23:03,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 04:23:03,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205777533] [2022-07-23 04:23:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:23:03,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 04:23:03,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:23:03,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 04:23:03,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 04:23:03,399 INFO L87 Difference]: Start difference. First operand 2538 states and 3497 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:23:05,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:23:08,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:23:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:23:10,376 INFO L93 Difference]: Finished difference Result 6287 states and 8860 transitions. [2022-07-23 04:23:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 04:23:10,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 3 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 142 [2022-07-23 04:23:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:23:10,392 INFO L225 Difference]: With dead ends: 6287 [2022-07-23 04:23:10,392 INFO L226 Difference]: Without dead ends: 3768 [2022-07-23 04:23:10,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 04:23:10,403 INFO L413 NwaCegarLoop]: 2488 mSDtfsCounter, 927 mSDsluCounter, 2355 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 436 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 4843 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 436 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:23:10,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 4843 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [436 Valid, 1342 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-07-23 04:23:10,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2022-07-23 04:23:10,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 2540. [2022-07-23 04:23:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 1681 states have (on average 1.2444973230220107) internal successors, (2092), 1731 states have internal predecessors, (2092), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:23:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3499 transitions. [2022-07-23 04:23:10,580 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3499 transitions. Word has length 142 [2022-07-23 04:23:10,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:23:10,581 INFO L495 AbstractCegarLoop]: Abstraction has 2540 states and 3499 transitions. [2022-07-23 04:23:10,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-23 04:23:10,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3499 transitions. [2022-07-23 04:23:10,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 04:23:10,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:23:10,584 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-23 04:23:10,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 04:23:10,584 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 22 more)] === [2022-07-23 04:23:10,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:23:10,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1338717108, now seen corresponding path program 1 times [2022-07-23 04:23:10,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:23:10,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133974446] [2022-07-23 04:23:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:23:10,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:23:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:10,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:23:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:10,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:23:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:10,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:10,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:23:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:10,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:23:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:10,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:23:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:10,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:23:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:23:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:23:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:23:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:23:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:23:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:23:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:23:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:23:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:23:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:23:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:23:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:23:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:23:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:11,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-23 04:23:11,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:23:11,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133974446] [2022-07-23 04:23:11,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133974446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:23:11,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:23:11,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:23:11,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710344195] [2022-07-23 04:23:11,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:23:11,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:23:11,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:23:11,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:23:11,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:23:11,130 INFO L87 Difference]: Start difference. First operand 2540 states and 3499 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-23 04:23:13,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:23:15,218 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-23 04:23:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:23:18,637 INFO L93 Difference]: Finished difference Result 2540 states and 3499 transitions. [2022-07-23 04:23:18,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:23:18,638 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-23 04:23:18,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:23:18,646 INFO L225 Difference]: With dead ends: 2540 [2022-07-23 04:23:18,646 INFO L226 Difference]: Without dead ends: 2538 [2022-07-23 04:23:18,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:23:18,648 INFO L413 NwaCegarLoop]: 1680 mSDtfsCounter, 2361 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2549 SdHoareTripleChecker+Valid, 3579 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:23:18,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2549 Valid, 3579 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1655 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-07-23 04:23:18,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-07-23 04:23:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-07-23 04:23:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 1680 states have (on average 1.244047619047619) internal successors, (2090), 1729 states have internal predecessors, (2090), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:23:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3497 transitions. [2022-07-23 04:23:18,807 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3497 transitions. Word has length 138 [2022-07-23 04:23:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:23:18,807 INFO L495 AbstractCegarLoop]: Abstraction has 2538 states and 3497 transitions. [2022-07-23 04:23:18,808 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-23 04:23:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3497 transitions. [2022-07-23 04:23:18,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-23 04:23:18,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:23:18,811 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:23:18,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 04:23:18,812 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-23 04:23:18,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:23:18,812 INFO L85 PathProgramCache]: Analyzing trace with hash -2044121712, now seen corresponding path program 1 times [2022-07-23 04:23:18,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:23:18,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42667653] [2022-07-23 04:23:18,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:23:18,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:23:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:23:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:23:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:23:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:23:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:23:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:23:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:23:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:23:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-23 04:23:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:23:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:23:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:23:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-23 04:23:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:23:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-23 04:23:19,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:23:19,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42667653] [2022-07-23 04:23:19,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42667653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:23:19,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:23:19,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 04:23:19,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240056567] [2022-07-23 04:23:19,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:23:19,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 04:23:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:23:19,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 04:23:19,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 04:23:19,266 INFO L87 Difference]: Start difference. First operand 2538 states and 3497 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:23:21,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:23:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:23:24,111 INFO L93 Difference]: Finished difference Result 5085 states and 7014 transitions. [2022-07-23 04:23:24,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 04:23:24,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (20), 3 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 148 [2022-07-23 04:23:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:23:24,121 INFO L225 Difference]: With dead ends: 5085 [2022-07-23 04:23:24,121 INFO L226 Difference]: Without dead ends: 2566 [2022-07-23 04:23:24,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 04:23:24,131 INFO L413 NwaCegarLoop]: 1759 mSDtfsCounter, 378 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 375 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 3588 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:23:24,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 3588 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 1135 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-07-23 04:23:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2022-07-23 04:23:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2540. [2022-07-23 04:23:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 1682 states have (on average 1.243757431629013) internal successors, (2092), 1731 states have internal predecessors, (2092), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:23:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3499 transitions. [2022-07-23 04:23:24,279 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3499 transitions. Word has length 148 [2022-07-23 04:23:24,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:23:24,280 INFO L495 AbstractCegarLoop]: Abstraction has 2540 states and 3499 transitions. [2022-07-23 04:23:24,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:23:24,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3499 transitions. [2022-07-23 04:23:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-23 04:23:24,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:23:24,283 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:23:24,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 04:23:24,283 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-23 04:23:24,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:23:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash 314205643, now seen corresponding path program 1 times [2022-07-23 04:23:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:23:24,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049519140] [2022-07-23 04:23:24,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:23:24,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:23:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:23:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:23:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:23:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:23:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:23:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:23:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:23:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:23:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-23 04:23:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:23:24,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:23:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:23:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:23:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 04:23:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-23 04:23:24,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:23:24,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049519140] [2022-07-23 04:23:24,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049519140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:23:24,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:23:24,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:23:24,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860651402] [2022-07-23 04:23:24,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:23:24,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:23:24,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:23:24,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:23:24,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:23:24,931 INFO L87 Difference]: Start difference. First operand 2540 states and 3499 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:23:26,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:23:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:23:30,975 INFO L93 Difference]: Finished difference Result 5313 states and 7363 transitions. [2022-07-23 04:23:30,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 04:23:30,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (20), 3 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 149 [2022-07-23 04:23:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:23:30,986 INFO L225 Difference]: With dead ends: 5313 [2022-07-23 04:23:30,986 INFO L226 Difference]: Without dead ends: 2792 [2022-07-23 04:23:30,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:23:30,995 INFO L413 NwaCegarLoop]: 1926 mSDtfsCounter, 586 mSDsluCounter, 4309 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 584 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 6235 SdHoareTripleChecker+Invalid, 3233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:23:30,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 6235 Invalid, 3233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2648 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-07-23 04:23:30,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2792 states. [2022-07-23 04:23:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2792 to 2546. [2022-07-23 04:23:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 1688 states have (on average 1.2428909952606635) internal successors, (2098), 1737 states have internal predecessors, (2098), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:23:31,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3505 transitions. [2022-07-23 04:23:31,147 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3505 transitions. Word has length 149 [2022-07-23 04:23:31,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:23:31,148 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 3505 transitions. [2022-07-23 04:23:31,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-23 04:23:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3505 transitions. [2022-07-23 04:23:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-23 04:23:31,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:23:31,150 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-23 04:23:31,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 04:23:31,151 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 22 more)] === [2022-07-23 04:23:31,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:23:31,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1843540752, now seen corresponding path program 1 times [2022-07-23 04:23:31,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:23:31,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610623781] [2022-07-23 04:23:31,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:23:31,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:23:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:23:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:23:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:23:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:23:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:23:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:23:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:23:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:23:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:23:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:23:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:23:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:23:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:23:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:23:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:23:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:23:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:23:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:23:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:23:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:23:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:31,665 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-23 04:23:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:23:31,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610623781] [2022-07-23 04:23:31,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610623781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:23:31,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:23:31,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:23:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666512846] [2022-07-23 04:23:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:23:31,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:23:31,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:23:31,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:23:31,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:23:31,669 INFO L87 Difference]: Start difference. First operand 2546 states and 3505 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-23 04:23:33,727 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:23:35,744 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-23 04:23:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:23:38,669 INFO L93 Difference]: Finished difference Result 2546 states and 3505 transitions. [2022-07-23 04:23:38,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:23:38,669 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-23 04:23:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:23:38,676 INFO L225 Difference]: With dead ends: 2546 [2022-07-23 04:23:38,677 INFO L226 Difference]: Without dead ends: 2544 [2022-07-23 04:23:38,677 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-23 04:23:38,678 INFO L413 NwaCegarLoop]: 1678 mSDtfsCounter, 2355 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2542 SdHoareTripleChecker+Valid, 3577 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:23:38,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2542 Valid, 3577 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1653 Invalid, 2 Unknown, 0 Unchecked, 6.8s Time] [2022-07-23 04:23:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2022-07-23 04:23:38,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2022-07-23 04:23:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 1687 states have (on average 1.2424422050978068) internal successors, (2096), 1735 states have internal predecessors, (2096), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:23:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3503 transitions. [2022-07-23 04:23:38,836 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3503 transitions. Word has length 144 [2022-07-23 04:23:38,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:23:38,837 INFO L495 AbstractCegarLoop]: Abstraction has 2544 states and 3503 transitions. [2022-07-23 04:23:38,837 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-23 04:23:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3503 transitions. [2022-07-23 04:23:38,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-23 04:23:38,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:23:38,839 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-23 04:23:38,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 04:23:38,840 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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 22 more)] === [2022-07-23 04:23:38,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:23:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1641086931, now seen corresponding path program 1 times [2022-07-23 04:23:38,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:23:38,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977442129] [2022-07-23 04:23:38,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:23:38,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:23:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:23:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:23:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-23 04:23:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-23 04:23:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-23 04:23:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-23 04:23:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:23:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:23:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:23:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-23 04:23:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:23:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:23:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:23:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:23:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-23 04:23:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-23 04:23:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-23 04:23:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:23:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-23 04:23:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:23:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:23:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:39,354 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-23 04:23:39,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:23:39,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977442129] [2022-07-23 04:23:39,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977442129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:23:39,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:23:39,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:23:39,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141046815] [2022-07-23 04:23:39,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:23:39,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:23:39,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:23:39,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:23:39,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:23:39,357 INFO L87 Difference]: Start difference. First operand 2544 states and 3503 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-23 04:23:41,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:23:43,430 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-23 04:23:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:23:46,769 INFO L93 Difference]: Finished difference Result 2544 states and 3503 transitions. [2022-07-23 04:23:46,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:23:46,770 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-23 04:23:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:23:46,780 INFO L225 Difference]: With dead ends: 2544 [2022-07-23 04:23:46,780 INFO L226 Difference]: Without dead ends: 2542 [2022-07-23 04:23:46,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:23:46,784 INFO L413 NwaCegarLoop]: 1676 mSDtfsCounter, 2349 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 1402 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2535 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 3055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1402 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:23:46,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2535 Valid, 3575 Invalid, 3055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1402 Valid, 1651 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-07-23 04:23:46,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2022-07-23 04:23:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2022-07-23 04:23:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 1686 states have (on average 1.2419928825622777) internal successors, (2094), 1733 states have internal predecessors, (2094), 703 states have call successors, (703), 145 states have call predecessors, (703), 144 states have return successors, (704), 692 states have call predecessors, (704), 701 states have call successors, (704) [2022-07-23 04:23:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 3501 transitions. [2022-07-23 04:23:47,008 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 3501 transitions. Word has length 150 [2022-07-23 04:23:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:23:47,009 INFO L495 AbstractCegarLoop]: Abstraction has 2542 states and 3501 transitions. [2022-07-23 04:23:47,009 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-23 04:23:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 3501 transitions. [2022-07-23 04:23:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-23 04:23:47,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:23:47,012 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:23:47,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 04:23:47,012 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-23 04:23:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:23:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1086141802, now seen corresponding path program 1 times [2022-07-23 04:23:47,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:23:47,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127761447] [2022-07-23 04:23:47,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:23:47,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:23:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:23:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:23:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:23:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:23:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:23:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:23:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:23:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:23:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:23:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:23:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:23:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:23:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:23:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 04:23:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-23 04:23:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:23:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:23:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-23 04:23:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-23 04:23:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:23:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-23 04:23:48,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:23:48,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127761447] [2022-07-23 04:23:48,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127761447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:23:48,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:23:48,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:23:48,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780011854] [2022-07-23 04:23:48,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:23:48,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:23:48,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:23:48,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:23:48,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:23:48,745 INFO L87 Difference]: Start difference. First operand 2542 states and 3501 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:23:50,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:24:00,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:24:00,139 INFO L93 Difference]: Finished difference Result 7997 states and 11450 transitions. [2022-07-23 04:24:00,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:24:00,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (21), 3 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 170 [2022-07-23 04:24:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:24:00,160 INFO L225 Difference]: With dead ends: 7997 [2022-07-23 04:24:00,161 INFO L226 Difference]: Without dead ends: 5474 [2022-07-23 04:24:00,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:24:00,172 INFO L413 NwaCegarLoop]: 2942 mSDtfsCounter, 2715 mSDsluCounter, 5616 mSDsCounter, 0 mSdLazyCounter, 3532 mSolverCounterSat, 1531 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2989 SdHoareTripleChecker+Valid, 8558 SdHoareTripleChecker+Invalid, 5064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1531 IncrementalHoareTripleChecker+Valid, 3532 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-07-23 04:24:00,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2989 Valid, 8558 Invalid, 5064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1531 Valid, 3532 Invalid, 1 Unknown, 0 Unchecked, 10.8s Time] [2022-07-23 04:24:00,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5474 states. [2022-07-23 04:24:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5474 to 2560. [2022-07-23 04:24:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2560 states, 1702 states have (on average 1.2408930669800236) internal successors, (2112), 1749 states have internal predecessors, (2112), 705 states have call successors, (705), 145 states have call predecessors, (705), 144 states have return successors, (706), 694 states have call predecessors, (706), 703 states have call successors, (706) [2022-07-23 04:24:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2560 states to 2560 states and 3523 transitions. [2022-07-23 04:24:00,460 INFO L78 Accepts]: Start accepts. Automaton has 2560 states and 3523 transitions. Word has length 170 [2022-07-23 04:24:00,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:24:00,461 INFO L495 AbstractCegarLoop]: Abstraction has 2560 states and 3523 transitions. [2022-07-23 04:24:00,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:24:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2560 states and 3523 transitions. [2022-07-23 04:24:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-23 04:24:00,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:24:00,464 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:24:00,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-23 04:24:00,464 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-23 04:24:00,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:24:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1846211539, now seen corresponding path program 1 times [2022-07-23 04:24:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:24:00,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330618365] [2022-07-23 04:24:00,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:24:00,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:24:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:24:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:24:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:24:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:24:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:24:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:24:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:24:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:24:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:24:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:24:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 04:24:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-23 04:24:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:24:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-23 04:24:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:24:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:24:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-07-23 04:24:01,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:24:01,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330618365] [2022-07-23 04:24:01,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330618365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:24:01,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:24:01,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:24:01,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10463862] [2022-07-23 04:24:01,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:24:01,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:24:01,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:24:01,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:24:01,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:24:01,384 INFO L87 Difference]: Start difference. First operand 2560 states and 3523 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:24:03,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-23 04:24:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:24:10,629 INFO L93 Difference]: Finished difference Result 8035 states and 11486 transitions. [2022-07-23 04:24:10,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:24:10,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 3 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 171 [2022-07-23 04:24:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:24:10,651 INFO L225 Difference]: With dead ends: 8035 [2022-07-23 04:24:10,651 INFO L226 Difference]: Without dead ends: 5494 [2022-07-23 04:24:10,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:24:10,662 INFO L413 NwaCegarLoop]: 3067 mSDtfsCounter, 2643 mSDsluCounter, 5754 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 1513 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2916 SdHoareTripleChecker+Valid, 8821 SdHoareTripleChecker+Invalid, 5051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1513 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:24:10,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2916 Valid, 8821 Invalid, 5051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1513 Valid, 3537 Invalid, 1 Unknown, 0 Unchecked, 8.5s Time] [2022-07-23 04:24:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5494 states. [2022-07-23 04:24:10,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5494 to 2564. [2022-07-23 04:24:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 1706 states have (on average 1.2403282532239155) internal successors, (2116), 1753 states have internal predecessors, (2116), 705 states have call successors, (705), 145 states have call predecessors, (705), 144 states have return successors, (706), 694 states have call predecessors, (706), 703 states have call successors, (706) [2022-07-23 04:24:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3527 transitions. [2022-07-23 04:24:10,978 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3527 transitions. Word has length 171 [2022-07-23 04:24:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:24:10,979 INFO L495 AbstractCegarLoop]: Abstraction has 2564 states and 3527 transitions. [2022-07-23 04:24:10,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 3 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-23 04:24:10,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3527 transitions. [2022-07-23 04:24:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-23 04:24:10,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:24:10,982 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:24:10,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 04:24:10,983 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-23 04:24:10,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:24:10,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1423509713, now seen corresponding path program 1 times [2022-07-23 04:24:10,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:24:10,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399125912] [2022-07-23 04:24:10,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:24:10,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:24:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:24:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:24:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:24:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:24:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:24:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:24:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:24:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:24:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:24:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:24:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 04:24:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-23 04:24:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:24:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-23 04:24:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:24:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:24:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-23 04:24:13,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:24:13,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399125912] [2022-07-23 04:24:13,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399125912] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:24:13,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406103493] [2022-07-23 04:24:13,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:24:13,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:24:13,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:24:13,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:24:13,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 04:24:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:22,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 5279 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-23 04:24:22,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:24:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-07-23 04:24:22,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:24:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2022-07-23 04:24:23,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406103493] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-23 04:24:23,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-23 04:24:23,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 8] total 18 [2022-07-23 04:24:23,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842696234] [2022-07-23 04:24:23,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:24:23,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:24:23,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:24:23,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:24:23,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2022-07-23 04:24:23,277 INFO L87 Difference]: Start difference. First operand 2564 states and 3527 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-23 04:24:23,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:24:23,788 INFO L93 Difference]: Finished difference Result 5109 states and 7035 transitions. [2022-07-23 04:24:23,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 04:24:23,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 171 [2022-07-23 04:24:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:24:23,800 INFO L225 Difference]: With dead ends: 5109 [2022-07-23 04:24:23,800 INFO L226 Difference]: Without dead ends: 2564 [2022-07-23 04:24:23,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-07-23 04:24:23,809 INFO L413 NwaCegarLoop]: 1824 mSDtfsCounter, 14 mSDsluCounter, 7260 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 9084 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:24:23,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 9084 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 04:24:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states. [2022-07-23 04:24:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2564. [2022-07-23 04:24:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 1706 states have (on average 1.23915592028136) internal successors, (2114), 1753 states have internal predecessors, (2114), 705 states have call successors, (705), 145 states have call predecessors, (705), 144 states have return successors, (706), 694 states have call predecessors, (706), 703 states have call successors, (706) [2022-07-23 04:24:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3525 transitions. [2022-07-23 04:24:24,068 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3525 transitions. Word has length 171 [2022-07-23 04:24:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:24:24,068 INFO L495 AbstractCegarLoop]: Abstraction has 2564 states and 3525 transitions. [2022-07-23 04:24:24,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2022-07-23 04:24:24,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3525 transitions. [2022-07-23 04:24:24,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-23 04:24:24,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:24:24,071 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:24:24,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 04:24:24,291 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,SelfDestructingSolverStorable22 [2022-07-23 04:24:24,291 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-23 04:24:24,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:24:24,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1816536723, now seen corresponding path program 1 times [2022-07-23 04:24:24,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:24:24,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993145339] [2022-07-23 04:24:24,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:24:24,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:24:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:24:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:24:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:24:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:24:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:24:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:24:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:24:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:24:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:24:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:24:26,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 04:24:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-23 04:24:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:24:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-23 04:24:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:24:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:24:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-23 04:24:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:24:26,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993145339] [2022-07-23 04:24:26,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993145339] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:24:26,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925815632] [2022-07-23 04:24:26,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:24:26,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:24:26,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:24:26,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:24:26,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 04:24:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:28,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 5280 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 04:24:28,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:24:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-07-23 04:24:28,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:24:28,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925815632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:24:28,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:24:28,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-07-23 04:24:28,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419553725] [2022-07-23 04:24:28,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:24:28,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:24:28,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:24:28,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:24:28,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:24:28,577 INFO L87 Difference]: Start difference. First operand 2564 states and 3525 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-23 04:24:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:24:28,912 INFO L93 Difference]: Finished difference Result 5199 states and 7169 transitions. [2022-07-23 04:24:28,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 04:24:28,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 171 [2022-07-23 04:24:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:24:28,926 INFO L225 Difference]: With dead ends: 5199 [2022-07-23 04:24:28,926 INFO L226 Difference]: Without dead ends: 2654 [2022-07-23 04:24:28,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-07-23 04:24:28,936 INFO L413 NwaCegarLoop]: 1970 mSDtfsCounter, 547 mSDsluCounter, 7115 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 9085 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:24:28,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 9085 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 04:24:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2022-07-23 04:24:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2564. [2022-07-23 04:24:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 1706 states have (on average 1.2379835873388043) internal successors, (2112), 1753 states have internal predecessors, (2112), 705 states have call successors, (705), 145 states have call predecessors, (705), 144 states have return successors, (706), 694 states have call predecessors, (706), 703 states have call successors, (706) [2022-07-23 04:24:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3523 transitions. [2022-07-23 04:24:29,247 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3523 transitions. Word has length 171 [2022-07-23 04:24:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:24:29,247 INFO L495 AbstractCegarLoop]: Abstraction has 2564 states and 3523 transitions. [2022-07-23 04:24:29,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-23 04:24:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3523 transitions. [2022-07-23 04:24:29,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-23 04:24:29,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:24:29,250 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:24:29,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-23 04:24:29,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-23 04:24:29,472 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting smc91c92_releaseErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 22 more)] === [2022-07-23 04:24:29,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:24:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash -465151505, now seen corresponding path program 1 times [2022-07-23 04:24:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:24:29,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329267504] [2022-07-23 04:24:29,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:24:29,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:24:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:24:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-23 04:24:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-23 04:24:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-23 04:24:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:24:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:30,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:24:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-23 04:24:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:24:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-23 04:24:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:24:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:24:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:24:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-23 04:24:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-23 04:24:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-23 04:24:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-23 04:24:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-23 04:24:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:24:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:24:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-23 04:24:30,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:24:30,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329267504] [2022-07-23 04:24:30,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329267504] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:24:30,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900299729] [2022-07-23 04:24:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:24:30,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:24:30,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:24:30,286 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:24:30,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 04:24:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:24:32,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 5281 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 04:24:32,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:24:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-07-23 04:24:32,389 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:24:32,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900299729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:24:32,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:24:32,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2022-07-23 04:24:32,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688713650] [2022-07-23 04:24:32,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:24:32,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 04:24:32,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:24:32,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 04:24:32,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2022-07-23 04:24:32,392 INFO L87 Difference]: Start difference. First operand 2564 states and 3523 transitions. Second operand has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (20), 4 states have call predecessors, (20), 4 states have call successors, (20)