./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--char--ipmi--ipmi_msghandler.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 173e3943 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--char--ipmi--ipmi_msghandler.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 1b79bc3bed5bfb059718e76e7116aac9b8952405f0b578f08aab2c60e1303883 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-173e394 [2021-11-06 21:30:35,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-06 21:30:35,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-06 21:30:35,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-06 21:30:35,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-06 21:30:35,551 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-06 21:30:35,551 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-06 21:30:35,553 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-06 21:30:35,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-06 21:30:35,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-06 21:30:35,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-06 21:30:35,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-06 21:30:35,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-06 21:30:35,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-06 21:30:35,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-06 21:30:35,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-06 21:30:35,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-06 21:30:35,560 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-06 21:30:35,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-06 21:30:35,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-06 21:30:35,563 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-06 21:30:35,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-06 21:30:35,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-06 21:30:35,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-06 21:30:35,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-06 21:30:35,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-06 21:30:35,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-06 21:30:35,572 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-06 21:30:35,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-06 21:30:35,573 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-06 21:30:35,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-06 21:30:35,574 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-06 21:30:35,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-06 21:30:35,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-06 21:30:35,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-06 21:30:35,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-06 21:30:35,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-06 21:30:35,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-06 21:30:35,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-06 21:30:35,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-06 21:30:35,578 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-06 21:30:35,579 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-11-06 21:30:35,594 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-06 21:30:35,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-06 21:30:35,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-06 21:30:35,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-06 21:30:35,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-06 21:30:35,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-06 21:30:35,596 INFO L138 SettingsManager]: * Use SBE=true [2021-11-06 21:30:35,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-06 21:30:35,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-06 21:30:35,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-06 21:30:35,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-06 21:30:35,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-06 21:30:35,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-06 21:30:35,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-06 21:30:35,601 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-06 21:30:35,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-06 21:30:35,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-06 21:30:35,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-06 21:30:35,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-06 21:30:35,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:30:35,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-06 21:30:35,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-06 21:30:35,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-06 21:30:35,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-06 21:30:35,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-06 21:30:35,603 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-06 21:30:35,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-06 21:30:35,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-06 21:30:35,604 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-06 21:30:35,604 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 -> 1b79bc3bed5bfb059718e76e7116aac9b8952405f0b578f08aab2c60e1303883 [2021-11-06 21:30:35,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-06 21:30:35,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-06 21:30:35,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-06 21:30:35,819 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-06 21:30:35,820 INFO L275 PluginConnector]: CDTParser initialized [2021-11-06 21:30:35,821 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--char--ipmi--ipmi_msghandler.ko.cil.i [2021-11-06 21:30:35,870 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e8132fd/3b45c6ca942e48129a68cd70805f721c/FLAG08aea11d8 [2021-11-06 21:30:36,546 INFO L306 CDTParser]: Found 1 translation units. [2021-11-06 21:30:36,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i [2021-11-06 21:30:36,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e8132fd/3b45c6ca942e48129a68cd70805f721c/FLAG08aea11d8 [2021-11-06 21:30:36,849 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47e8132fd/3b45c6ca942e48129a68cd70805f721c [2021-11-06 21:30:36,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-06 21:30:36,852 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-06 21:30:36,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-06 21:30:36,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-06 21:30:36,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-06 21:30:36,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:30:36" (1/1) ... [2021-11-06 21:30:36,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ad0c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:36, skipping insertion in model container [2021-11-06 21:30:36,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:30:36" (1/1) ... [2021-11-06 21:30:36,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-06 21:30:36,993 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-06 21:30:41,654 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489067,489080] [2021-11-06 21:30:41,656 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489212,489225] [2021-11-06 21:30:41,657 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489358,489371] [2021-11-06 21:30:41,657 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489523,489536] [2021-11-06 21:30:41,657 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489681,489694] [2021-11-06 21:30:41,658 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489839,489852] [2021-11-06 21:30:41,658 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489997,490010] [2021-11-06 21:30:41,658 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[490157,490170] [2021-11-06 21:30:41,659 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[490316,490329] [2021-11-06 21:30:41,659 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[490455,490468] [2021-11-06 21:30:41,660 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[490597,490610] [2021-11-06 21:30:41,661 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[490746,490759] [2021-11-06 21:30:41,661 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[490885,490898] [2021-11-06 21:30:41,661 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491040,491053] [2021-11-06 21:30:41,662 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491200,491213] [2021-11-06 21:30:41,662 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491351,491364] [2021-11-06 21:30:41,662 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491502,491515] [2021-11-06 21:30:41,663 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491654,491667] [2021-11-06 21:30:41,663 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491803,491816] [2021-11-06 21:30:41,663 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491951,491964] [2021-11-06 21:30:41,664 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[492108,492121] [2021-11-06 21:30:41,664 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[492257,492270] [2021-11-06 21:30:41,664 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[492413,492426] [2021-11-06 21:30:41,665 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[492566,492579] [2021-11-06 21:30:41,665 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[492712,492725] [2021-11-06 21:30:41,665 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[492855,492868] [2021-11-06 21:30:41,666 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493007,493020] [2021-11-06 21:30:41,666 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493153,493166] [2021-11-06 21:30:41,666 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493298,493311] [2021-11-06 21:30:41,667 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493452,493465] [2021-11-06 21:30:41,667 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493603,493616] [2021-11-06 21:30:41,679 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493758,493771] [2021-11-06 21:30:41,680 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493910,493923] [2021-11-06 21:30:41,680 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[494065,494078] [2021-11-06 21:30:41,681 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[494229,494242] [2021-11-06 21:30:41,681 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[494385,494398] [2021-11-06 21:30:41,682 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[494549,494562] [2021-11-06 21:30:41,682 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[494691,494704] [2021-11-06 21:30:41,683 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[494849,494862] [2021-11-06 21:30:41,683 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495016,495029] [2021-11-06 21:30:41,684 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495175,495188] [2021-11-06 21:30:41,685 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495334,495347] [2021-11-06 21:30:41,685 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495483,495496] [2021-11-06 21:30:41,685 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495630,495643] [2021-11-06 21:30:41,686 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495769,495782] [2021-11-06 21:30:41,687 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495932,495945] [2021-11-06 21:30:41,688 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[496098,496111] [2021-11-06 21:30:41,688 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[496262,496275] [2021-11-06 21:30:41,689 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[496427,496440] [2021-11-06 21:30:41,690 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[496592,496605] [2021-11-06 21:30:41,690 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[496758,496771] [2021-11-06 21:30:41,691 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[496923,496936] [2021-11-06 21:30:41,691 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[497090,497103] [2021-11-06 21:30:41,692 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[497250,497263] [2021-11-06 21:30:41,692 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[497412,497425] [2021-11-06 21:30:41,692 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[497571,497584] [2021-11-06 21:30:41,693 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[497717,497730] [2021-11-06 21:30:41,693 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[497860,497873] [2021-11-06 21:30:41,693 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498004,498017] [2021-11-06 21:30:41,693 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498147,498160] [2021-11-06 21:30:41,694 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498291,498304] [2021-11-06 21:30:41,694 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498432,498445] [2021-11-06 21:30:41,695 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498570,498583] [2021-11-06 21:30:41,695 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498728,498741] [2021-11-06 21:30:41,695 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498887,498900] [2021-11-06 21:30:41,696 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499043,499056] [2021-11-06 21:30:41,696 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499192,499205] [2021-11-06 21:30:41,696 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499344,499357] [2021-11-06 21:30:41,696 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499495,499508] [2021-11-06 21:30:41,697 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499644,499657] [2021-11-06 21:30:41,697 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499796,499809] [2021-11-06 21:30:41,697 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499944,499957] [2021-11-06 21:30:41,698 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500097,500110] [2021-11-06 21:30:41,698 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500248,500261] [2021-11-06 21:30:41,698 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500398,500411] [2021-11-06 21:30:41,699 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500545,500558] [2021-11-06 21:30:41,700 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500696,500709] [2021-11-06 21:30:41,700 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500847,500860] [2021-11-06 21:30:41,700 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500995,501008] [2021-11-06 21:30:41,700 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[501161,501174] [2021-11-06 21:30:41,701 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[501330,501343] [2021-11-06 21:30:41,701 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[501497,501510] [2021-11-06 21:30:41,702 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[501665,501678] [2021-11-06 21:30:41,702 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[501815,501828] [2021-11-06 21:30:41,702 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[501962,501975] [2021-11-06 21:30:41,702 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[502123,502136] [2021-11-06 21:30:41,703 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[502293,502306] [2021-11-06 21:30:41,703 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[502455,502468] [2021-11-06 21:30:41,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:30:41,772 INFO L203 MainTranslator]: Completed pre-run [2021-11-06 21:30:42,091 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489067,489080] [2021-11-06 21:30:42,093 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489212,489225] [2021-11-06 21:30:42,096 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489358,489371] [2021-11-06 21:30:42,097 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489523,489536] [2021-11-06 21:30:42,098 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489681,489694] [2021-11-06 21:30:42,098 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489839,489852] [2021-11-06 21:30:42,099 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[489997,490010] [2021-11-06 21:30:42,099 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[490157,490170] [2021-11-06 21:30:42,100 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[490316,490329] [2021-11-06 21:30:42,100 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[490455,490468] [2021-11-06 21:30:42,101 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[490597,490610] [2021-11-06 21:30:42,101 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[490746,490759] [2021-11-06 21:30:42,101 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[490885,490898] [2021-11-06 21:30:42,102 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491040,491053] [2021-11-06 21:30:42,102 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491200,491213] [2021-11-06 21:30:42,103 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491351,491364] [2021-11-06 21:30:42,103 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491502,491515] [2021-11-06 21:30:42,103 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491654,491667] [2021-11-06 21:30:42,104 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491803,491816] [2021-11-06 21:30:42,104 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[491951,491964] [2021-11-06 21:30:42,104 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[492108,492121] [2021-11-06 21:30:42,105 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[492257,492270] [2021-11-06 21:30:42,105 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[492413,492426] [2021-11-06 21:30:42,105 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[492566,492579] [2021-11-06 21:30:42,106 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[492712,492725] [2021-11-06 21:30:42,106 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[492855,492868] [2021-11-06 21:30:42,106 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493007,493020] [2021-11-06 21:30:42,106 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493153,493166] [2021-11-06 21:30:42,107 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493298,493311] [2021-11-06 21:30:42,107 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493452,493465] [2021-11-06 21:30:42,107 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493603,493616] [2021-11-06 21:30:42,107 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493758,493771] [2021-11-06 21:30:42,108 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[493910,493923] [2021-11-06 21:30:42,108 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[494065,494078] [2021-11-06 21:30:42,108 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[494229,494242] [2021-11-06 21:30:42,109 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[494385,494398] [2021-11-06 21:30:42,109 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[494549,494562] [2021-11-06 21:30:42,109 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[494691,494704] [2021-11-06 21:30:42,110 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[494849,494862] [2021-11-06 21:30:42,110 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495016,495029] [2021-11-06 21:30:42,110 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495175,495188] [2021-11-06 21:30:42,111 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495334,495347] [2021-11-06 21:30:42,111 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495483,495496] [2021-11-06 21:30:42,112 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495630,495643] [2021-11-06 21:30:42,112 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495769,495782] [2021-11-06 21:30:42,112 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[495932,495945] [2021-11-06 21:30:42,112 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[496098,496111] [2021-11-06 21:30:42,113 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[496262,496275] [2021-11-06 21:30:42,113 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[496427,496440] [2021-11-06 21:30:42,113 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[496592,496605] [2021-11-06 21:30:42,114 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[496758,496771] [2021-11-06 21:30:42,114 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[496923,496936] [2021-11-06 21:30:42,114 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[497090,497103] [2021-11-06 21:30:42,114 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[497250,497263] [2021-11-06 21:30:42,115 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[497412,497425] [2021-11-06 21:30:42,115 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[497571,497584] [2021-11-06 21:30:42,115 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[497717,497730] [2021-11-06 21:30:42,116 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[497860,497873] [2021-11-06 21:30:42,116 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498004,498017] [2021-11-06 21:30:42,116 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498147,498160] [2021-11-06 21:30:42,116 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498291,498304] [2021-11-06 21:30:42,117 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498432,498445] [2021-11-06 21:30:42,117 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498570,498583] [2021-11-06 21:30:42,118 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498728,498741] [2021-11-06 21:30:42,118 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[498887,498900] [2021-11-06 21:30:42,122 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499043,499056] [2021-11-06 21:30:42,123 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499192,499205] [2021-11-06 21:30:42,131 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499344,499357] [2021-11-06 21:30:42,132 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499495,499508] [2021-11-06 21:30:42,132 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499644,499657] [2021-11-06 21:30:42,132 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499796,499809] [2021-11-06 21:30:42,132 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[499944,499957] [2021-11-06 21:30:42,133 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500097,500110] [2021-11-06 21:30:42,133 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500248,500261] [2021-11-06 21:30:42,133 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500398,500411] [2021-11-06 21:30:42,133 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500545,500558] [2021-11-06 21:30:42,134 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500696,500709] [2021-11-06 21:30:42,134 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500847,500860] [2021-11-06 21:30:42,134 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[500995,501008] [2021-11-06 21:30:42,134 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[501161,501174] [2021-11-06 21:30:42,135 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[501330,501343] [2021-11-06 21:30:42,135 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[501497,501510] [2021-11-06 21:30:42,135 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[501665,501678] [2021-11-06 21:30:42,135 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[501815,501828] [2021-11-06 21:30:42,136 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[501962,501975] [2021-11-06 21:30:42,136 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[502123,502136] [2021-11-06 21:30:42,136 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[502293,502306] [2021-11-06 21:30:42,136 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i[502455,502468] [2021-11-06 21:30:42,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-06 21:30:42,330 INFO L208 MainTranslator]: Completed translation [2021-11-06 21:30:42,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:42 WrapperNode [2021-11-06 21:30:42,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-06 21:30:42,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-06 21:30:42,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-06 21:30:42,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-06 21:30:42,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:42" (1/1) ... [2021-11-06 21:30:42,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:42" (1/1) ... [2021-11-06 21:30:42,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-06 21:30:42,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-06 21:30:42,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-06 21:30:42,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-06 21:30:42,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:42" (1/1) ... [2021-11-06 21:30:42,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:42" (1/1) ... [2021-11-06 21:30:42,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:42" (1/1) ... [2021-11-06 21:30:42,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:42" (1/1) ... [2021-11-06 21:30:42,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:42" (1/1) ... [2021-11-06 21:30:43,044 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:42" (1/1) ... [2021-11-06 21:30:43,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:42" (1/1) ... [2021-11-06 21:30:43,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-06 21:30:43,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-06 21:30:43,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-06 21:30:43,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-06 21:30:43,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:42" (1/1) ... [2021-11-06 21:30:43,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-06 21:30:43,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:30:43,288 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) [2021-11-06 21:30:43,355 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 [2021-11-06 21:30:43,383 INFO L130 BoogieDeclarations]: Found specification of procedure intf_next_seq [2021-11-06 21:30:43,383 INFO L138 BoogieDeclarations]: Found implementation of procedure intf_next_seq [2021-11-06 21:30:43,383 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~ipmi_smi_t~0~X~$Pointer$~TO~VOID [2021-11-06 21:30:43,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~ipmi_smi_t~0~X~$Pointer$~TO~VOID [2021-11-06 21:30:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-06 21:30:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_195 [2021-11-06 21:30:43,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_195 [2021-11-06 21:30:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer_194 [2021-11-06 21:30:43,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer_194 [2021-11-06 21:30:43,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_instance_callback_15_2 [2021-11-06 21:30:43,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_instance_callback_15_2 [2021-11-06 21:30:43,385 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2021-11-06 21:30:43,385 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2021-11-06 21:30:43,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-06 21:30:43,385 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mod_timer [2021-11-06 21:30:43,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mod_timer [2021-11-06 21:30:43,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-06 21:30:43,386 INFO L130 BoogieDeclarations]: Found specification of procedure handle_new_recv_msgs [2021-11-06 21:30:43,386 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_new_recv_msgs [2021-11-06 21:30:43,386 INFO L130 BoogieDeclarations]: Found specification of procedure intf_free [2021-11-06 21:30:43,386 INFO L138 BoogieDeclarations]: Found implementation of procedure intf_free [2021-11-06 21:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2021-11-06 21:30:43,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2021-11-06 21:30:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-06 21:30:43,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-06 21:30:43,404 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_smi_msg_received [2021-11-06 21:30:43,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_smi_msg_received [2021-11-06 21:30:43,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-11-06 21:30:43,404 INFO L130 BoogieDeclarations]: Found specification of procedure handle_ipmb_get_msg_cmd [2021-11-06 21:30:43,404 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_ipmb_get_msg_cmd [2021-11-06 21:30:43,404 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_smi_msg [2021-11-06 21:30:43,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_smi_msg [2021-11-06 21:30:43,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-06 21:30:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-06 21:30:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure clean_up_interface_data [2021-11-06 21:30:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure clean_up_interface_data [2021-11-06 21:30:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure handle_ipmb_get_msg_rsp [2021-11-06 21:30:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_ipmb_get_msg_rsp [2021-11-06 21:30:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-06 21:30:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_timeout_handler [2021-11-06 21:30:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_timeout_handler [2021-11-06 21:30:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure intf_err_seq [2021-11-06 21:30:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure intf_err_seq [2021-11-06 21:30:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_timeout [2021-11-06 21:30:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_timeout [2021-11-06 21:30:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure smi_recv_tasklet [2021-11-06 21:30:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure smi_recv_tasklet [2021-11-06 21:30:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2021-11-06 21:30:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2021-11-06 21:30:43,406 INFO L130 BoogieDeclarations]: Found specification of procedure handle_lan_get_msg_cmd [2021-11-06 21:30:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_lan_get_msg_cmd [2021-11-06 21:30:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure handle_bmc_rsp [2021-11-06 21:30:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_bmc_rsp [2021-11-06 21:30:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure handle_oem_get_msg_cmd [2021-11-06 21:30:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_oem_get_msg_cmd [2021-11-06 21:30:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure need_waiter [2021-11-06 21:30:43,407 INFO L138 BoogieDeclarations]: Found implementation of procedure need_waiter [2021-11-06 21:30:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-06 21:30:43,407 INFO L130 BoogieDeclarations]: Found specification of procedure i_ipmi_request [2021-11-06 21:30:43,408 INFO L138 BoogieDeclarations]: Found implementation of procedure i_ipmi_request [2021-11-06 21:30:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-11-06 21:30:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure free_smi_msg_list [2021-11-06 21:30:43,408 INFO L138 BoogieDeclarations]: Found implementation of procedure free_smi_msg_list [2021-11-06 21:30:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-11-06 21:30:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure deliver_err_response [2021-11-06 21:30:43,408 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver_err_response [2021-11-06 21:30:43,408 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_instance_register_17_2 [2021-11-06 21:30:43,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_instance_register_17_2 [2021-11-06 21:30:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure send_channel_info_cmd [2021-11-06 21:30:43,409 INFO L138 BoogieDeclarations]: Found implementation of procedure send_channel_info_cmd [2021-11-06 21:30:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure handle_one_recv_msg [2021-11-06 21:30:43,409 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_one_recv_msg [2021-11-06 21:30:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-11-06 21:30:43,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-11-06 21:30:43,409 INFO L130 BoogieDeclarations]: Found specification of procedure channel_handler [2021-11-06 21:30:43,409 INFO L138 BoogieDeclarations]: Found implementation of procedure channel_handler [2021-11-06 21:30:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure __cmpxchg_wrong_size [2021-11-06 21:30:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2021-11-06 21:30:43,410 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2021-11-06 21:30:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-11-06 21:30:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure handle_read_event_rsp [2021-11-06 21:30:43,410 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_read_event_rsp [2021-11-06 21:30:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-06 21:30:43,410 INFO L130 BoogieDeclarations]: Found specification of procedure handle_lan_get_msg_rsp [2021-11-06 21:30:43,410 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_lan_get_msg_rsp [2021-11-06 21:30:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure free_recv_msg_list [2021-11-06 21:30:43,411 INFO L138 BoogieDeclarations]: Found implementation of procedure free_recv_msg_list [2021-11-06 21:30:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_timer_timer_instance_15 [2021-11-06 21:30:43,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_timer_timer_instance_15 [2021-11-06 21:30:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure deliver_response [2021-11-06 21:30:43,411 INFO L138 BoogieDeclarations]: Found implementation of procedure deliver_response [2021-11-06 21:30:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-06 21:30:43,411 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-11-06 21:30:58,442 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_entry_EMGentry_20_returnLabel: main_#res := 0; [2021-11-06 21:30:58,442 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2021-11-06 21:30:58,443 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L11138: #t~ret1806 := main_#res; [2021-11-06 21:30:58,749 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-06 21:30:58,749 INFO L299 CfgBuilder]: Removed 2579 assume(true) statements. [2021-11-06 21:30:58,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:30:58 BoogieIcfgContainer [2021-11-06 21:30:58,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-06 21:30:58,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-06 21:30:58,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-06 21:30:58,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-06 21:30:58,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:30:36" (1/3) ... [2021-11-06 21:30:58,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdb3870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:30:58, skipping insertion in model container [2021-11-06 21:30:58,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:30:42" (2/3) ... [2021-11-06 21:30:58,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdb3870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:30:58, skipping insertion in model container [2021-11-06 21:30:58,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:30:58" (3/3) ... [2021-11-06 21:30:58,760 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--char--ipmi--ipmi_msghandler.ko.cil.i [2021-11-06 21:30:58,763 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-06 21:30:58,766 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 114 error locations. [2021-11-06 21:30:58,807 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-06 21:30:58,810 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-06 21:30:58,811 INFO L340 AbstractCegarLoop]: Starting to check reachability of 114 error locations. [2021-11-06 21:30:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 2540 states, 2307 states have (on average 1.3814477676636325) internal successors, (3187), 2441 states have internal predecessors, (3187), 81 states have call successors, (81), 38 states have call predecessors, (81), 38 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2021-11-06 21:30:58,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-06 21:30:58,848 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:30:58,848 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:30:58,848 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:30:58,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:30:58,852 INFO L85 PathProgramCache]: Analyzing trace with hash 210526816, now seen corresponding path program 1 times [2021-11-06 21:30:58,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:30:58,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457217178] [2021-11-06 21:30:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:30:58,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:30:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:30:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:30:59,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:30:59,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457217178] [2021-11-06 21:30:59,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457217178] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:30:59,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:30:59,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:30:59,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562345426] [2021-11-06 21:30:59,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:30:59,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:30:59,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:30:59,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:30:59,395 INFO L87 Difference]: Start difference. First operand has 2540 states, 2307 states have (on average 1.3814477676636325) internal successors, (3187), 2441 states have internal predecessors, (3187), 81 states have call successors, (81), 38 states have call predecessors, (81), 38 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:30:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:30:59,563 INFO L93 Difference]: Finished difference Result 5736 states and 7594 transitions. [2021-11-06 21:30:59,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:30:59,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-06 21:30:59,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:30:59,586 INFO L225 Difference]: With dead ends: 5736 [2021-11-06 21:30:59,587 INFO L226 Difference]: Without dead ends: 2932 [2021-11-06 21:30:59,601 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:30:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2021-11-06 21:30:59,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2847. [2021-11-06 21:30:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2847 states, 2614 states have (on average 1.237184391736802) internal successors, (3234), 2748 states have internal predecessors, (3234), 81 states have call successors, (81), 38 states have call predecessors, (81), 38 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2021-11-06 21:30:59,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 3396 transitions. [2021-11-06 21:30:59,740 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 3396 transitions. Word has length 21 [2021-11-06 21:30:59,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:30:59,741 INFO L470 AbstractCegarLoop]: Abstraction has 2847 states and 3396 transitions. [2021-11-06 21:30:59,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:30:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 3396 transitions. [2021-11-06 21:30:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-06 21:30:59,743 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:30:59,743 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:30:59,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-06 21:30:59,743 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:30:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:30:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash -158304315, now seen corresponding path program 1 times [2021-11-06 21:30:59,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:30:59,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805224363] [2021-11-06 21:30:59,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:30:59,746 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:30:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:00,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:00,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805224363] [2021-11-06 21:31:00,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805224363] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:00,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:00,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:00,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845759825] [2021-11-06 21:31:00,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:00,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:00,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:00,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:00,009 INFO L87 Difference]: Start difference. First operand 2847 states and 3396 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:00,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:00,148 INFO L93 Difference]: Finished difference Result 2847 states and 3396 transitions. [2021-11-06 21:31:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:00,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-11-06 21:31:00,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:00,164 INFO L225 Difference]: With dead ends: 2847 [2021-11-06 21:31:00,164 INFO L226 Difference]: Without dead ends: 2843 [2021-11-06 21:31:00,166 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2021-11-06 21:31:00,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2843. [2021-11-06 21:31:00,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 2612 states have (on average 1.2366003062787136) internal successors, (3230), 2744 states have internal predecessors, (3230), 81 states have call successors, (81), 38 states have call predecessors, (81), 38 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2021-11-06 21:31:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 3392 transitions. [2021-11-06 21:31:00,250 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 3392 transitions. Word has length 23 [2021-11-06 21:31:00,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:00,251 INFO L470 AbstractCegarLoop]: Abstraction has 2843 states and 3392 transitions. [2021-11-06 21:31:00,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:00,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 3392 transitions. [2021-11-06 21:31:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-06 21:31:00,253 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:00,253 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:00,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-06 21:31:00,254 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1806300759, now seen corresponding path program 1 times [2021-11-06 21:31:00,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:00,254 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603855099] [2021-11-06 21:31:00,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:00,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:00,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:00,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603855099] [2021-11-06 21:31:00,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603855099] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:00,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:00,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:00,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185260165] [2021-11-06 21:31:00,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:00,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:00,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:00,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:00,514 INFO L87 Difference]: Start difference. First operand 2843 states and 3392 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:00,594 INFO L93 Difference]: Finished difference Result 2843 states and 3392 transitions. [2021-11-06 21:31:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:00,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-06 21:31:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:00,604 INFO L225 Difference]: With dead ends: 2843 [2021-11-06 21:31:00,604 INFO L226 Difference]: Without dead ends: 2839 [2021-11-06 21:31:00,605 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2021-11-06 21:31:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2839. [2021-11-06 21:31:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2839 states, 2610 states have (on average 1.236015325670498) internal successors, (3226), 2740 states have internal predecessors, (3226), 81 states have call successors, (81), 38 states have call predecessors, (81), 38 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2021-11-06 21:31:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2839 states to 2839 states and 3388 transitions. [2021-11-06 21:31:00,672 INFO L78 Accepts]: Start accepts. Automaton has 2839 states and 3388 transitions. Word has length 25 [2021-11-06 21:31:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:00,672 INFO L470 AbstractCegarLoop]: Abstraction has 2839 states and 3388 transitions. [2021-11-06 21:31:00,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2839 states and 3388 transitions. [2021-11-06 21:31:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-06 21:31:00,677 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:00,677 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:00,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-06 21:31:00,677 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:00,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:00,678 INFO L85 PathProgramCache]: Analyzing trace with hash -687950867, now seen corresponding path program 1 times [2021-11-06 21:31:00,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:00,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83681452] [2021-11-06 21:31:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:00,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:00,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:00,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83681452] [2021-11-06 21:31:00,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83681452] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:00,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:00,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:00,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663804693] [2021-11-06 21:31:00,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:00,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:00,928 INFO L87 Difference]: Start difference. First operand 2839 states and 3388 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:01,001 INFO L93 Difference]: Finished difference Result 2839 states and 3388 transitions. [2021-11-06 21:31:01,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:01,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-06 21:31:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:01,011 INFO L225 Difference]: With dead ends: 2839 [2021-11-06 21:31:01,012 INFO L226 Difference]: Without dead ends: 2835 [2021-11-06 21:31:01,013 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:01,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2021-11-06 21:31:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2835. [2021-11-06 21:31:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2608 states have (on average 1.2354294478527608) internal successors, (3222), 2736 states have internal predecessors, (3222), 81 states have call successors, (81), 38 states have call predecessors, (81), 38 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2021-11-06 21:31:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3384 transitions. [2021-11-06 21:31:01,109 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3384 transitions. Word has length 27 [2021-11-06 21:31:01,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:01,110 INFO L470 AbstractCegarLoop]: Abstraction has 2835 states and 3384 transitions. [2021-11-06 21:31:01,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:01,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3384 transitions. [2021-11-06 21:31:01,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-06 21:31:01,111 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:01,111 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:01,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-06 21:31:01,111 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:01,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:01,111 INFO L85 PathProgramCache]: Analyzing trace with hash 304471697, now seen corresponding path program 1 times [2021-11-06 21:31:01,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:01,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259216867] [2021-11-06 21:31:01,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:01,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:01,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:01,410 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259216867] [2021-11-06 21:31:01,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259216867] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:01,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:01,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:01,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756697249] [2021-11-06 21:31:01,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:01,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:01,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:01,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:01,411 INFO L87 Difference]: Start difference. First operand 2835 states and 3384 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:01,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:01,479 INFO L93 Difference]: Finished difference Result 2835 states and 3384 transitions. [2021-11-06 21:31:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:01,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-06 21:31:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:01,488 INFO L225 Difference]: With dead ends: 2835 [2021-11-06 21:31:01,488 INFO L226 Difference]: Without dead ends: 2831 [2021-11-06 21:31:01,489 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2021-11-06 21:31:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2831. [2021-11-06 21:31:01,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2606 states have (on average 1.234842670759785) internal successors, (3218), 2732 states have internal predecessors, (3218), 81 states have call successors, (81), 38 states have call predecessors, (81), 38 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2021-11-06 21:31:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 3380 transitions. [2021-11-06 21:31:01,563 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 3380 transitions. Word has length 29 [2021-11-06 21:31:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:01,563 INFO L470 AbstractCegarLoop]: Abstraction has 2831 states and 3380 transitions. [2021-11-06 21:31:01,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3380 transitions. [2021-11-06 21:31:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-06 21:31:01,564 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:01,564 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:01,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-06 21:31:01,565 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:01,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:01,565 INFO L85 PathProgramCache]: Analyzing trace with hash 539816341, now seen corresponding path program 1 times [2021-11-06 21:31:01,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:01,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987085741] [2021-11-06 21:31:01,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:01,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:01,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:01,771 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987085741] [2021-11-06 21:31:01,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987085741] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:01,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:01,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:01,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357944644] [2021-11-06 21:31:01,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:01,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:01,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:01,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:01,774 INFO L87 Difference]: Start difference. First operand 2831 states and 3380 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:01,855 INFO L93 Difference]: Finished difference Result 2831 states and 3380 transitions. [2021-11-06 21:31:01,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:01,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-11-06 21:31:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:01,866 INFO L225 Difference]: With dead ends: 2831 [2021-11-06 21:31:01,866 INFO L226 Difference]: Without dead ends: 2827 [2021-11-06 21:31:01,868 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2021-11-06 21:31:01,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2827. [2021-11-06 21:31:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2604 states have (on average 1.2342549923195085) internal successors, (3214), 2728 states have internal predecessors, (3214), 81 states have call successors, (81), 38 states have call predecessors, (81), 38 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2021-11-06 21:31:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3376 transitions. [2021-11-06 21:31:01,954 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3376 transitions. Word has length 31 [2021-11-06 21:31:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:01,956 INFO L470 AbstractCegarLoop]: Abstraction has 2827 states and 3376 transitions. [2021-11-06 21:31:01,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3376 transitions. [2021-11-06 21:31:01,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-06 21:31:01,957 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:01,958 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:01,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-06 21:31:01,958 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:01,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:01,958 INFO L85 PathProgramCache]: Analyzing trace with hash -927247111, now seen corresponding path program 1 times [2021-11-06 21:31:01,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:01,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830181076] [2021-11-06 21:31:01,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:01,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:02,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:02,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:02,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830181076] [2021-11-06 21:31:02,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830181076] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:02,155 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:02,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:02,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237586089] [2021-11-06 21:31:02,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:02,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:02,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:02,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:02,156 INFO L87 Difference]: Start difference. First operand 2827 states and 3376 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:02,225 INFO L93 Difference]: Finished difference Result 2827 states and 3376 transitions. [2021-11-06 21:31:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:02,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-11-06 21:31:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:02,234 INFO L225 Difference]: With dead ends: 2827 [2021-11-06 21:31:02,234 INFO L226 Difference]: Without dead ends: 2823 [2021-11-06 21:31:02,235 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2021-11-06 21:31:02,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2021-11-06 21:31:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2823 states, 2602 states have (on average 1.2336664104534973) internal successors, (3210), 2724 states have internal predecessors, (3210), 81 states have call successors, (81), 38 states have call predecessors, (81), 38 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2021-11-06 21:31:02,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 3372 transitions. [2021-11-06 21:31:02,357 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 3372 transitions. Word has length 33 [2021-11-06 21:31:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:02,357 INFO L470 AbstractCegarLoop]: Abstraction has 2823 states and 3372 transitions. [2021-11-06 21:31:02,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 3372 transitions. [2021-11-06 21:31:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-06 21:31:02,358 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:02,358 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:02,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-06 21:31:02,359 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:02,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2025951043, now seen corresponding path program 1 times [2021-11-06 21:31:02,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:02,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380237879] [2021-11-06 21:31:02,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:02,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:02,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:02,544 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380237879] [2021-11-06 21:31:02,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380237879] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:02,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:02,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:02,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743131601] [2021-11-06 21:31:02,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:02,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:02,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:02,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:02,546 INFO L87 Difference]: Start difference. First operand 2823 states and 3372 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:02,628 INFO L93 Difference]: Finished difference Result 2823 states and 3372 transitions. [2021-11-06 21:31:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:02,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-11-06 21:31:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:02,638 INFO L225 Difference]: With dead ends: 2823 [2021-11-06 21:31:02,638 INFO L226 Difference]: Without dead ends: 2819 [2021-11-06 21:31:02,640 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2819 states. [2021-11-06 21:31:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2819 to 2819. [2021-11-06 21:31:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2819 states, 2600 states have (on average 1.2330769230769232) internal successors, (3206), 2720 states have internal predecessors, (3206), 81 states have call successors, (81), 38 states have call predecessors, (81), 38 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2021-11-06 21:31:02,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2819 states to 2819 states and 3368 transitions. [2021-11-06 21:31:02,729 INFO L78 Accepts]: Start accepts. Automaton has 2819 states and 3368 transitions. Word has length 35 [2021-11-06 21:31:02,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:02,730 INFO L470 AbstractCegarLoop]: Abstraction has 2819 states and 3368 transitions. [2021-11-06 21:31:02,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:02,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2819 states and 3368 transitions. [2021-11-06 21:31:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-06 21:31:02,731 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:02,731 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:02,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-06 21:31:02,731 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:02,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:02,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1318474527, now seen corresponding path program 1 times [2021-11-06 21:31:02,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:02,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504758958] [2021-11-06 21:31:02,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:02,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:02,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:02,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504758958] [2021-11-06 21:31:02,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504758958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:02,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:02,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:02,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810193358] [2021-11-06 21:31:02,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:02,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:02,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:02,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:02,940 INFO L87 Difference]: Start difference. First operand 2819 states and 3368 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:03,019 INFO L93 Difference]: Finished difference Result 2819 states and 3368 transitions. [2021-11-06 21:31:03,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:03,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-11-06 21:31:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:03,028 INFO L225 Difference]: With dead ends: 2819 [2021-11-06 21:31:03,028 INFO L226 Difference]: Without dead ends: 2815 [2021-11-06 21:31:03,030 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:03,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2021-11-06 21:31:03,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2815. [2021-11-06 21:31:03,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2815 states, 2598 states have (on average 1.2324865280985373) internal successors, (3202), 2716 states have internal predecessors, (3202), 81 states have call successors, (81), 38 states have call predecessors, (81), 38 states have return successors, (81), 77 states have call predecessors, (81), 81 states have call successors, (81) [2021-11-06 21:31:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 3364 transitions. [2021-11-06 21:31:03,106 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 3364 transitions. Word has length 37 [2021-11-06 21:31:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:03,107 INFO L470 AbstractCegarLoop]: Abstraction has 2815 states and 3364 transitions. [2021-11-06 21:31:03,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 3364 transitions. [2021-11-06 21:31:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-11-06 21:31:03,109 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:03,109 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:03,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-06 21:31:03,109 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting smi_recv_taskletErr0ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:03,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:03,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1090332181, now seen corresponding path program 1 times [2021-11-06 21:31:03,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:03,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221233602] [2021-11-06 21:31:03,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:03,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:03,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:03,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221233602] [2021-11-06 21:31:03,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221233602] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:03,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:03,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:03,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563477071] [2021-11-06 21:31:03,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:03,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:03,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:03,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:03,353 INFO L87 Difference]: Start difference. First operand 2815 states and 3364 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:03,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:03,591 INFO L93 Difference]: Finished difference Result 5093 states and 6260 transitions. [2021-11-06 21:31:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:31:03,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2021-11-06 21:31:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:03,609 INFO L225 Difference]: With dead ends: 5093 [2021-11-06 21:31:03,609 INFO L226 Difference]: Without dead ends: 5091 [2021-11-06 21:31:03,612 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2021-11-06 21:31:03,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 4252. [2021-11-06 21:31:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4252 states, 3917 states have (on average 1.2772529997447026) internal successors, (5003), 4055 states have internal predecessors, (5003), 161 states have call successors, (161), 76 states have call predecessors, (161), 76 states have return successors, (260), 154 states have call predecessors, (260), 161 states have call successors, (260) [2021-11-06 21:31:03,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4252 states to 4252 states and 5424 transitions. [2021-11-06 21:31:03,793 INFO L78 Accepts]: Start accepts. Automaton has 4252 states and 5424 transitions. Word has length 44 [2021-11-06 21:31:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:03,794 INFO L470 AbstractCegarLoop]: Abstraction has 4252 states and 5424 transitions. [2021-11-06 21:31:03,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 4252 states and 5424 transitions. [2021-11-06 21:31:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-06 21:31:03,795 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:03,795 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:03,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-06 21:31:03,795 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:03,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash -38376060, now seen corresponding path program 1 times [2021-11-06 21:31:03,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:03,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365788253] [2021-11-06 21:31:03,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:03,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:04,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:04,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365788253] [2021-11-06 21:31:04,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365788253] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:04,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:04,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:04,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515637567] [2021-11-06 21:31:04,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:04,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:04,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:04,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:04,024 INFO L87 Difference]: Start difference. First operand 4252 states and 5424 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:04,151 INFO L93 Difference]: Finished difference Result 4252 states and 5424 transitions. [2021-11-06 21:31:04,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:04,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-11-06 21:31:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:04,165 INFO L225 Difference]: With dead ends: 4252 [2021-11-06 21:31:04,166 INFO L226 Difference]: Without dead ends: 4248 [2021-11-06 21:31:04,168 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4248 states. [2021-11-06 21:31:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4248 to 4248. [2021-11-06 21:31:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4248 states, 3915 states have (on average 1.2768837803320563) internal successors, (4999), 4051 states have internal predecessors, (4999), 161 states have call successors, (161), 76 states have call predecessors, (161), 76 states have return successors, (260), 154 states have call predecessors, (260), 161 states have call successors, (260) [2021-11-06 21:31:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4248 states to 4248 states and 5420 transitions. [2021-11-06 21:31:04,303 INFO L78 Accepts]: Start accepts. Automaton has 4248 states and 5420 transitions. Word has length 39 [2021-11-06 21:31:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:04,304 INFO L470 AbstractCegarLoop]: Abstraction has 4248 states and 5420 transitions. [2021-11-06 21:31:04,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 4248 states and 5420 transitions. [2021-11-06 21:31:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-06 21:31:04,304 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:04,304 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:04,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-06 21:31:04,305 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1775605384, now seen corresponding path program 1 times [2021-11-06 21:31:04,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:04,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839810605] [2021-11-06 21:31:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:04,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:04,522 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:04,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839810605] [2021-11-06 21:31:04,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839810605] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:04,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:04,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:04,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943461575] [2021-11-06 21:31:04,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:04,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:04,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:04,524 INFO L87 Difference]: Start difference. First operand 4248 states and 5420 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:04,641 INFO L93 Difference]: Finished difference Result 4248 states and 5420 transitions. [2021-11-06 21:31:04,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:04,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-11-06 21:31:04,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:04,649 INFO L225 Difference]: With dead ends: 4248 [2021-11-06 21:31:04,650 INFO L226 Difference]: Without dead ends: 4244 [2021-11-06 21:31:04,651 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:04,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4244 states. [2021-11-06 21:31:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4244 to 4244. [2021-11-06 21:31:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4244 states, 3913 states have (on average 1.2765141834909277) internal successors, (4995), 4047 states have internal predecessors, (4995), 161 states have call successors, (161), 76 states have call predecessors, (161), 76 states have return successors, (260), 154 states have call predecessors, (260), 161 states have call successors, (260) [2021-11-06 21:31:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4244 states to 4244 states and 5416 transitions. [2021-11-06 21:31:04,800 INFO L78 Accepts]: Start accepts. Automaton has 4244 states and 5416 transitions. Word has length 41 [2021-11-06 21:31:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:04,800 INFO L470 AbstractCegarLoop]: Abstraction has 4244 states and 5416 transitions. [2021-11-06 21:31:04,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 4244 states and 5416 transitions. [2021-11-06 21:31:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-06 21:31:04,801 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:04,802 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:04,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-06 21:31:04,802 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting smi_recv_taskletErr1ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:04,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:04,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1855957300, now seen corresponding path program 1 times [2021-11-06 21:31:04,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:04,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361170393] [2021-11-06 21:31:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:04,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:05,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:05,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:05,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361170393] [2021-11-06 21:31:05,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361170393] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:05,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:05,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:05,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921706202] [2021-11-06 21:31:05,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:31:05,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:05,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:31:05,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:31:05,013 INFO L87 Difference]: Start difference. First operand 4244 states and 5416 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:05,154 INFO L93 Difference]: Finished difference Result 7993 states and 10509 transitions. [2021-11-06 21:31:05,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:31:05,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-06 21:31:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:05,166 INFO L225 Difference]: With dead ends: 7993 [2021-11-06 21:31:05,167 INFO L226 Difference]: Without dead ends: 4261 [2021-11-06 21:31:05,185 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:31:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2021-11-06 21:31:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 4254. [2021-11-06 21:31:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4254 states, 3923 states have (on average 1.2768289574305378) internal successors, (5009), 4057 states have internal predecessors, (5009), 161 states have call successors, (161), 76 states have call predecessors, (161), 76 states have return successors, (260), 154 states have call predecessors, (260), 161 states have call successors, (260) [2021-11-06 21:31:05,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4254 states to 4254 states and 5430 transitions. [2021-11-06 21:31:05,421 INFO L78 Accepts]: Start accepts. Automaton has 4254 states and 5430 transitions. Word has length 48 [2021-11-06 21:31:05,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:05,422 INFO L470 AbstractCegarLoop]: Abstraction has 4254 states and 5430 transitions. [2021-11-06 21:31:05,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:05,422 INFO L276 IsEmpty]: Start isEmpty. Operand 4254 states and 5430 transitions. [2021-11-06 21:31:05,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-06 21:31:05,423 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:05,423 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:05,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-06 21:31:05,423 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:05,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:05,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1255051244, now seen corresponding path program 1 times [2021-11-06 21:31:05,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:05,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763879679] [2021-11-06 21:31:05,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:05,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:05,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:05,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763879679] [2021-11-06 21:31:05,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763879679] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:05,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:05,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:05,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749058465] [2021-11-06 21:31:05,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:05,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:05,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:05,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:05,612 INFO L87 Difference]: Start difference. First operand 4254 states and 5430 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:05,745 INFO L93 Difference]: Finished difference Result 4254 states and 5430 transitions. [2021-11-06 21:31:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:05,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-06 21:31:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:05,755 INFO L225 Difference]: With dead ends: 4254 [2021-11-06 21:31:05,755 INFO L226 Difference]: Without dead ends: 4250 [2021-11-06 21:31:05,758 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4250 states. [2021-11-06 21:31:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4250 to 4250. [2021-11-06 21:31:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 3921 states have (on average 1.2764600867125733) internal successors, (5005), 4053 states have internal predecessors, (5005), 161 states have call successors, (161), 76 states have call predecessors, (161), 76 states have return successors, (260), 154 states have call predecessors, (260), 161 states have call successors, (260) [2021-11-06 21:31:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 5426 transitions. [2021-11-06 21:31:05,910 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 5426 transitions. Word has length 43 [2021-11-06 21:31:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:05,910 INFO L470 AbstractCegarLoop]: Abstraction has 4250 states and 5426 transitions. [2021-11-06 21:31:05,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:05,911 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 5426 transitions. [2021-11-06 21:31:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-06 21:31:05,911 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:05,912 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:05,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-06 21:31:05,912 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ipmi_timeoutErr0ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:05,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:05,912 INFO L85 PathProgramCache]: Analyzing trace with hash 802981591, now seen corresponding path program 1 times [2021-11-06 21:31:05,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:05,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761897859] [2021-11-06 21:31:05,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:05,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:06,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:06,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761897859] [2021-11-06 21:31:06,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761897859] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:06,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:06,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:31:06,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580833086] [2021-11-06 21:31:06,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:31:06,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:06,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:31:06,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:06,113 INFO L87 Difference]: Start difference. First operand 4250 states and 5426 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:09,261 INFO L93 Difference]: Finished difference Result 8828 states and 11679 transitions. [2021-11-06 21:31:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:31:09,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-11-06 21:31:09,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:09,280 INFO L225 Difference]: With dead ends: 8828 [2021-11-06 21:31:09,280 INFO L226 Difference]: Without dead ends: 8826 [2021-11-06 21:31:09,283 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:31:09,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8826 states. [2021-11-06 21:31:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8826 to 7359. [2021-11-06 21:31:09,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7359 states, 6667 states have (on average 1.319334033298335) internal successors, (8796), 6862 states have internal predecessors, (8796), 383 states have call successors, (383), 210 states have call predecessors, (383), 217 states have return successors, (855), 364 states have call predecessors, (855), 383 states have call successors, (855) [2021-11-06 21:31:09,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7359 states to 7359 states and 10034 transitions. [2021-11-06 21:31:09,569 INFO L78 Accepts]: Start accepts. Automaton has 7359 states and 10034 transitions. Word has length 50 [2021-11-06 21:31:09,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:09,569 INFO L470 AbstractCegarLoop]: Abstraction has 7359 states and 10034 transitions. [2021-11-06 21:31:09,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:09,570 INFO L276 IsEmpty]: Start isEmpty. Operand 7359 states and 10034 transitions. [2021-11-06 21:31:09,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-06 21:31:09,570 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:09,571 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:09,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-06 21:31:09,571 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:09,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:09,571 INFO L85 PathProgramCache]: Analyzing trace with hash -781270608, now seen corresponding path program 1 times [2021-11-06 21:31:09,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:09,572 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639587636] [2021-11-06 21:31:09,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:09,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:09,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:09,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639587636] [2021-11-06 21:31:09,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639587636] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:09,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:09,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:09,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276558897] [2021-11-06 21:31:09,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:09,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:09,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:09,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:09,736 INFO L87 Difference]: Start difference. First operand 7359 states and 10034 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:10,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:10,025 INFO L93 Difference]: Finished difference Result 7359 states and 10034 transitions. [2021-11-06 21:31:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:10,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-06 21:31:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:10,043 INFO L225 Difference]: With dead ends: 7359 [2021-11-06 21:31:10,043 INFO L226 Difference]: Without dead ends: 7355 [2021-11-06 21:31:10,047 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7355 states. [2021-11-06 21:31:10,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7355 to 7355. [2021-11-06 21:31:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7355 states, 6665 states have (on average 1.3191297824456114) internal successors, (8792), 6858 states have internal predecessors, (8792), 383 states have call successors, (383), 210 states have call predecessors, (383), 217 states have return successors, (855), 364 states have call predecessors, (855), 383 states have call successors, (855) [2021-11-06 21:31:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7355 states to 7355 states and 10030 transitions. [2021-11-06 21:31:10,434 INFO L78 Accepts]: Start accepts. Automaton has 7355 states and 10030 transitions. Word has length 45 [2021-11-06 21:31:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:10,434 INFO L470 AbstractCegarLoop]: Abstraction has 7355 states and 10030 transitions. [2021-11-06 21:31:10,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:10,434 INFO L276 IsEmpty]: Start isEmpty. Operand 7355 states and 10030 transitions. [2021-11-06 21:31:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-06 21:31:10,435 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:10,435 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:10,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-06 21:31:10,435 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting handle_new_recv_msgsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash -188642403, now seen corresponding path program 1 times [2021-11-06 21:31:10,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:10,436 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53517878] [2021-11-06 21:31:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:10,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:10,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:10,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53517878] [2021-11-06 21:31:10,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53517878] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:10,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:10,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:10,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203675705] [2021-11-06 21:31:10,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:10,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:10,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:10,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:10,670 INFO L87 Difference]: Start difference. First operand 7355 states and 10030 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:11,272 INFO L93 Difference]: Finished difference Result 14749 states and 21855 transitions. [2021-11-06 21:31:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:31:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-11-06 21:31:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:11,316 INFO L225 Difference]: With dead ends: 14749 [2021-11-06 21:31:11,316 INFO L226 Difference]: Without dead ends: 14745 [2021-11-06 21:31:11,324 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14745 states. [2021-11-06 21:31:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14745 to 13220. [2021-11-06 21:31:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13220 states, 11938 states have (on average 1.3446976042888257) internal successors, (16053), 12233 states have internal predecessors, (16053), 759 states have call successors, (759), 414 states have call predecessors, (759), 433 states have return successors, (2989), 728 states have call predecessors, (2989), 759 states have call successors, (2989) [2021-11-06 21:31:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13220 states to 13220 states and 19801 transitions. [2021-11-06 21:31:11,959 INFO L78 Accepts]: Start accepts. Automaton has 13220 states and 19801 transitions. Word has length 52 [2021-11-06 21:31:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:11,959 INFO L470 AbstractCegarLoop]: Abstraction has 13220 states and 19801 transitions. [2021-11-06 21:31:11,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:11,959 INFO L276 IsEmpty]: Start isEmpty. Operand 13220 states and 19801 transitions. [2021-11-06 21:31:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-06 21:31:11,960 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:11,960 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:11,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-06 21:31:11,961 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:11,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash 818516948, now seen corresponding path program 1 times [2021-11-06 21:31:11,961 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:11,961 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704416276] [2021-11-06 21:31:11,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:11,961 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:12,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:12,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704416276] [2021-11-06 21:31:12,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704416276] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:12,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:12,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:12,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302489753] [2021-11-06 21:31:12,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:12,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:12,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:12,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:12,124 INFO L87 Difference]: Start difference. First operand 13220 states and 19801 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:12,728 INFO L93 Difference]: Finished difference Result 13947 states and 20542 transitions. [2021-11-06 21:31:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:31:12,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-06 21:31:12,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:12,772 INFO L225 Difference]: With dead ends: 13947 [2021-11-06 21:31:12,772 INFO L226 Difference]: Without dead ends: 13943 [2021-11-06 21:31:12,780 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13943 states. [2021-11-06 21:31:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13943 to 13785. [2021-11-06 21:31:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13785 states, 12503 states have (on average 1.332400223946253) internal successors, (16659), 12798 states have internal predecessors, (16659), 759 states have call successors, (759), 414 states have call predecessors, (759), 433 states have return successors, (2989), 728 states have call predecessors, (2989), 759 states have call successors, (2989) [2021-11-06 21:31:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13785 states to 13785 states and 20407 transitions. [2021-11-06 21:31:13,503 INFO L78 Accepts]: Start accepts. Automaton has 13785 states and 20407 transitions. Word has length 47 [2021-11-06 21:31:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:13,503 INFO L470 AbstractCegarLoop]: Abstraction has 13785 states and 20407 transitions. [2021-11-06 21:31:13,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 13785 states and 20407 transitions. [2021-11-06 21:31:13,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 21:31:13,504 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:13,504 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:13,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-06 21:31:13,505 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting smi_recv_taskletErr1ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:13,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:13,505 INFO L85 PathProgramCache]: Analyzing trace with hash 839087265, now seen corresponding path program 1 times [2021-11-06 21:31:13,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:13,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635095695] [2021-11-06 21:31:13,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:13,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:13,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:13,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635095695] [2021-11-06 21:31:13,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635095695] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:13,700 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:13,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:31:13,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279978067] [2021-11-06 21:31:13,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:13,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:13,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:13,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:13,702 INFO L87 Difference]: Start difference. First operand 13785 states and 20407 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:16,411 INFO L93 Difference]: Finished difference Result 15257 states and 22082 transitions. [2021-11-06 21:31:16,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:31:16,412 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-06 21:31:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:16,461 INFO L225 Difference]: With dead ends: 15257 [2021-11-06 21:31:16,462 INFO L226 Difference]: Without dead ends: 15255 [2021-11-06 21:31:16,472 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:16,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15255 states. [2021-11-06 21:31:17,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15255 to 13783. [2021-11-06 21:31:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13783 states, 12502 states have (on average 1.3319468884978403) internal successors, (16652), 12796 states have internal predecessors, (16652), 759 states have call successors, (759), 414 states have call predecessors, (759), 433 states have return successors, (2989), 728 states have call predecessors, (2989), 759 states have call successors, (2989) [2021-11-06 21:31:17,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13783 states to 13783 states and 20400 transitions. [2021-11-06 21:31:17,391 INFO L78 Accepts]: Start accepts. Automaton has 13783 states and 20400 transitions. Word has length 53 [2021-11-06 21:31:17,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:17,391 INFO L470 AbstractCegarLoop]: Abstraction has 13783 states and 20400 transitions. [2021-11-06 21:31:17,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 13783 states and 20400 transitions. [2021-11-06 21:31:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-06 21:31:17,392 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:17,393 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:17,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-06 21:31:17,393 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:17,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:17,393 INFO L85 PathProgramCache]: Analyzing trace with hash 616066648, now seen corresponding path program 1 times [2021-11-06 21:31:17,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:17,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734391839] [2021-11-06 21:31:17,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:17,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:17,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:17,576 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734391839] [2021-11-06 21:31:17,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734391839] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:17,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:17,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:17,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555841216] [2021-11-06 21:31:17,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:17,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:17,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:17,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:17,578 INFO L87 Difference]: Start difference. First operand 13783 states and 20400 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:18,046 INFO L93 Difference]: Finished difference Result 13783 states and 20400 transitions. [2021-11-06 21:31:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:18,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-06 21:31:18,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:18,158 INFO L225 Difference]: With dead ends: 13783 [2021-11-06 21:31:18,158 INFO L226 Difference]: Without dead ends: 13779 [2021-11-06 21:31:18,162 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13779 states. [2021-11-06 21:31:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13779 to 13779. [2021-11-06 21:31:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13779 states, 12500 states have (on average 1.33184) internal successors, (16648), 12792 states have internal predecessors, (16648), 759 states have call successors, (759), 414 states have call predecessors, (759), 433 states have return successors, (2989), 728 states have call predecessors, (2989), 759 states have call successors, (2989) [2021-11-06 21:31:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13779 states to 13779 states and 20396 transitions. [2021-11-06 21:31:18,700 INFO L78 Accepts]: Start accepts. Automaton has 13779 states and 20396 transitions. Word has length 49 [2021-11-06 21:31:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:18,701 INFO L470 AbstractCegarLoop]: Abstraction has 13779 states and 20396 transitions. [2021-11-06 21:31:18,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 13779 states and 20396 transitions. [2021-11-06 21:31:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 21:31:18,702 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:18,702 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:18,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-06 21:31:18,702 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:18,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:18,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1919751230, now seen corresponding path program 1 times [2021-11-06 21:31:18,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:18,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998921422] [2021-11-06 21:31:18,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:18,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:18,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:18,898 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998921422] [2021-11-06 21:31:18,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998921422] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:18,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:18,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:18,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235015005] [2021-11-06 21:31:18,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:18,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:18,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:18,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:18,901 INFO L87 Difference]: Start difference. First operand 13779 states and 20396 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:19,792 INFO L93 Difference]: Finished difference Result 20536 states and 31748 transitions. [2021-11-06 21:31:19,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:31:19,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-06 21:31:19,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:19,852 INFO L225 Difference]: With dead ends: 20536 [2021-11-06 21:31:19,853 INFO L226 Difference]: Without dead ends: 20532 [2021-11-06 21:31:19,862 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:19,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20532 states. [2021-11-06 21:31:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20532 to 19742. [2021-11-06 21:31:20,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19742 states, 17840 states have (on average 1.348262331838565) internal successors, (24053), 18231 states have internal predecessors, (24053), 1151 states have call successors, (1151), 650 states have call predecessors, (1151), 665 states have return successors, (5321), 1084 states have call predecessors, (5321), 1151 states have call successors, (5321) [2021-11-06 21:31:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19742 states to 19742 states and 30525 transitions. [2021-11-06 21:31:20,709 INFO L78 Accepts]: Start accepts. Automaton has 19742 states and 30525 transitions. Word has length 56 [2021-11-06 21:31:20,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:20,710 INFO L470 AbstractCegarLoop]: Abstraction has 19742 states and 30525 transitions. [2021-11-06 21:31:20,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:20,710 INFO L276 IsEmpty]: Start isEmpty. Operand 19742 states and 30525 transitions. [2021-11-06 21:31:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-11-06 21:31:20,711 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:20,711 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:20,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-06 21:31:20,711 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting handle_new_recv_msgsErr3ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:20,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:20,712 INFO L85 PathProgramCache]: Analyzing trace with hash 24092027, now seen corresponding path program 1 times [2021-11-06 21:31:20,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:20,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731793156] [2021-11-06 21:31:20,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:20,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:20,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:20,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731793156] [2021-11-06 21:31:20,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731793156] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:20,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:20,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:20,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274751355] [2021-11-06 21:31:20,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:31:20,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:20,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:31:20,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:31:20,881 INFO L87 Difference]: Start difference. First operand 19742 states and 30525 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:21,870 INFO L93 Difference]: Finished difference Result 39394 states and 66056 transitions. [2021-11-06 21:31:21,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:31:21,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-11-06 21:31:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:21,943 INFO L225 Difference]: With dead ends: 39394 [2021-11-06 21:31:21,943 INFO L226 Difference]: Without dead ends: 20202 [2021-11-06 21:31:22,097 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:31:22,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20202 states. [2021-11-06 21:31:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20202 to 19882. [2021-11-06 21:31:23,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19882 states, 17960 states have (on average 1.3464922048997774) internal successors, (24183), 18351 states have internal predecessors, (24183), 1171 states have call successors, (1171), 650 states have call predecessors, (1171), 665 states have return successors, (5419), 1114 states have call predecessors, (5419), 1171 states have call successors, (5419) [2021-11-06 21:31:23,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19882 states to 19882 states and 30773 transitions. [2021-11-06 21:31:23,331 INFO L78 Accepts]: Start accepts. Automaton has 19882 states and 30773 transitions. Word has length 56 [2021-11-06 21:31:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:23,331 INFO L470 AbstractCegarLoop]: Abstraction has 19882 states and 30773 transitions. [2021-11-06 21:31:23,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 19882 states and 30773 transitions. [2021-11-06 21:31:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-06 21:31:23,332 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:23,332 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:23,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-06 21:31:23,333 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash -665142980, now seen corresponding path program 1 times [2021-11-06 21:31:23,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:23,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327920120] [2021-11-06 21:31:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:23,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:23,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:23,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327920120] [2021-11-06 21:31:23,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327920120] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:23,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:23,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:23,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743240166] [2021-11-06 21:31:23,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:23,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:23,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:23,549 INFO L87 Difference]: Start difference. First operand 19882 states and 30773 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:24,440 INFO L93 Difference]: Finished difference Result 19882 states and 30773 transitions. [2021-11-06 21:31:24,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:24,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-11-06 21:31:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:24,610 INFO L225 Difference]: With dead ends: 19882 [2021-11-06 21:31:24,611 INFO L226 Difference]: Without dead ends: 19878 [2021-11-06 21:31:24,617 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19878 states. [2021-11-06 21:31:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19878 to 19878. [2021-11-06 21:31:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19878 states, 17958 states have (on average 1.3464194230983406) internal successors, (24179), 18347 states have internal predecessors, (24179), 1171 states have call successors, (1171), 650 states have call predecessors, (1171), 665 states have return successors, (5419), 1114 states have call predecessors, (5419), 1171 states have call successors, (5419) [2021-11-06 21:31:25,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19878 states to 19878 states and 30769 transitions. [2021-11-06 21:31:25,534 INFO L78 Accepts]: Start accepts. Automaton has 19878 states and 30769 transitions. Word has length 51 [2021-11-06 21:31:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:25,535 INFO L470 AbstractCegarLoop]: Abstraction has 19878 states and 30769 transitions. [2021-11-06 21:31:25,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 19878 states and 30769 transitions. [2021-11-06 21:31:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-06 21:31:25,536 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:25,536 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:25,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-06 21:31:25,536 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:25,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:25,536 INFO L85 PathProgramCache]: Analyzing trace with hash 748018816, now seen corresponding path program 1 times [2021-11-06 21:31:25,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:25,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630413841] [2021-11-06 21:31:25,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:25,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:25,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:25,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630413841] [2021-11-06 21:31:25,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630413841] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:25,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:25,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:25,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986415646] [2021-11-06 21:31:25,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:25,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:25,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:25,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:25,881 INFO L87 Difference]: Start difference. First operand 19878 states and 30769 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:26,590 INFO L93 Difference]: Finished difference Result 19878 states and 30769 transitions. [2021-11-06 21:31:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:26,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-11-06 21:31:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:26,648 INFO L225 Difference]: With dead ends: 19878 [2021-11-06 21:31:26,648 INFO L226 Difference]: Without dead ends: 19874 [2021-11-06 21:31:26,661 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19874 states. [2021-11-06 21:31:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19874 to 19874. [2021-11-06 21:31:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19874 states, 17956 states have (on average 1.3463466250835376) internal successors, (24175), 18343 states have internal predecessors, (24175), 1171 states have call successors, (1171), 650 states have call predecessors, (1171), 665 states have return successors, (5419), 1114 states have call predecessors, (5419), 1171 states have call successors, (5419) [2021-11-06 21:31:27,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19874 states to 19874 states and 30765 transitions. [2021-11-06 21:31:27,698 INFO L78 Accepts]: Start accepts. Automaton has 19874 states and 30765 transitions. Word has length 53 [2021-11-06 21:31:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:27,699 INFO L470 AbstractCegarLoop]: Abstraction has 19874 states and 30765 transitions. [2021-11-06 21:31:27,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 19874 states and 30765 transitions. [2021-11-06 21:31:27,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 21:31:27,700 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:27,700 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:27,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-06 21:31:27,700 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting handle_new_recv_msgsErr3ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:27,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1485590666, now seen corresponding path program 1 times [2021-11-06 21:31:27,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:27,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955157374] [2021-11-06 21:31:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:27,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:27,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:27,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955157374] [2021-11-06 21:31:27,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955157374] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:27,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:27,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:31:27,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436255688] [2021-11-06 21:31:27,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:27,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:27,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:27,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:27,860 INFO L87 Difference]: Start difference. First operand 19874 states and 30765 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:31,009 INFO L93 Difference]: Finished difference Result 22272 states and 33977 transitions. [2021-11-06 21:31:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:31:31,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-06 21:31:31,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:31,073 INFO L225 Difference]: With dead ends: 22272 [2021-11-06 21:31:31,073 INFO L226 Difference]: Without dead ends: 22268 [2021-11-06 21:31:31,086 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22268 states. [2021-11-06 21:31:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22268 to 19870. [2021-11-06 21:31:32,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19870 states, 17954 states have (on average 1.3452712487467973) internal successors, (24153), 18339 states have internal predecessors, (24153), 1171 states have call successors, (1171), 650 states have call predecessors, (1171), 665 states have return successors, (5419), 1114 states have call predecessors, (5419), 1171 states have call successors, (5419) [2021-11-06 21:31:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19870 states to 19870 states and 30743 transitions. [2021-11-06 21:31:32,112 INFO L78 Accepts]: Start accepts. Automaton has 19870 states and 30743 transitions. Word has length 61 [2021-11-06 21:31:32,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:32,114 INFO L470 AbstractCegarLoop]: Abstraction has 19870 states and 30743 transitions. [2021-11-06 21:31:32,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 19870 states and 30743 transitions. [2021-11-06 21:31:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-11-06 21:31:32,116 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:32,116 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:32,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-06 21:31:32,117 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:32,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1586839588, now seen corresponding path program 1 times [2021-11-06 21:31:32,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:32,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874306145] [2021-11-06 21:31:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:32,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:32,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:32,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874306145] [2021-11-06 21:31:32,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874306145] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:32,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:32,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:32,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987768976] [2021-11-06 21:31:32,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:32,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:32,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:32,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:32,305 INFO L87 Difference]: Start difference. First operand 19870 states and 30743 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:33,385 INFO L93 Difference]: Finished difference Result 19870 states and 30743 transitions. [2021-11-06 21:31:33,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:33,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-11-06 21:31:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:33,444 INFO L225 Difference]: With dead ends: 19870 [2021-11-06 21:31:33,444 INFO L226 Difference]: Without dead ends: 19866 [2021-11-06 21:31:33,457 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:33,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19866 states. [2021-11-06 21:31:34,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19866 to 19866. [2021-11-06 21:31:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19866 states, 17952 states have (on average 1.3451983065953654) internal successors, (24149), 18335 states have internal predecessors, (24149), 1171 states have call successors, (1171), 650 states have call predecessors, (1171), 665 states have return successors, (5419), 1114 states have call predecessors, (5419), 1171 states have call successors, (5419) [2021-11-06 21:31:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19866 states to 19866 states and 30739 transitions. [2021-11-06 21:31:34,615 INFO L78 Accepts]: Start accepts. Automaton has 19866 states and 30739 transitions. Word has length 55 [2021-11-06 21:31:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:34,615 INFO L470 AbstractCegarLoop]: Abstraction has 19866 states and 30739 transitions. [2021-11-06 21:31:34,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 19866 states and 30739 transitions. [2021-11-06 21:31:34,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 21:31:34,617 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:34,617 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:34,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-06 21:31:34,617 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ipmi_timeout_handlerErr7ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:34,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1928565802, now seen corresponding path program 1 times [2021-11-06 21:31:34,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:34,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435546656] [2021-11-06 21:31:34,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:34,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:34,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:34,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435546656] [2021-11-06 21:31:34,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435546656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:34,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:34,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:34,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181413023] [2021-11-06 21:31:34,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:31:34,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:34,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:31:34,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:31:34,774 INFO L87 Difference]: Start difference. First operand 19866 states and 30739 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:35,855 INFO L93 Difference]: Finished difference Result 36505 states and 59364 transitions. [2021-11-06 21:31:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:31:35,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-06 21:31:35,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:35,931 INFO L225 Difference]: With dead ends: 36505 [2021-11-06 21:31:35,931 INFO L226 Difference]: Without dead ends: 20500 [2021-11-06 21:31:36,034 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:31:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20500 states. [2021-11-06 21:31:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20500 to 19874. [2021-11-06 21:31:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19874 states, 17960 states have (on average 1.3450445434298441) internal successors, (24157), 18343 states have internal predecessors, (24157), 1171 states have call successors, (1171), 650 states have call predecessors, (1171), 665 states have return successors, (5419), 1114 states have call predecessors, (5419), 1171 states have call successors, (5419) [2021-11-06 21:31:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19874 states to 19874 states and 30747 transitions. [2021-11-06 21:31:37,147 INFO L78 Accepts]: Start accepts. Automaton has 19874 states and 30747 transitions. Word has length 63 [2021-11-06 21:31:37,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:37,148 INFO L470 AbstractCegarLoop]: Abstraction has 19874 states and 30747 transitions. [2021-11-06 21:31:37,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 19874 states and 30747 transitions. [2021-11-06 21:31:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-11-06 21:31:37,149 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:37,149 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:37,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-06 21:31:37,150 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:37,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash 239750184, now seen corresponding path program 1 times [2021-11-06 21:31:37,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:37,150 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754459098] [2021-11-06 21:31:37,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:37,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:37,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:37,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754459098] [2021-11-06 21:31:37,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754459098] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:37,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:37,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:37,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448151772] [2021-11-06 21:31:37,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:37,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:37,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:37,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:37,316 INFO L87 Difference]: Start difference. First operand 19874 states and 30747 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:38,091 INFO L93 Difference]: Finished difference Result 19874 states and 30747 transitions. [2021-11-06 21:31:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:38,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-11-06 21:31:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:38,149 INFO L225 Difference]: With dead ends: 19874 [2021-11-06 21:31:38,150 INFO L226 Difference]: Without dead ends: 19870 [2021-11-06 21:31:38,167 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:38,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19870 states. [2021-11-06 21:31:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19870 to 19870. [2021-11-06 21:31:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19870 states, 17958 states have (on average 1.3449716004009356) internal successors, (24153), 18339 states have internal predecessors, (24153), 1171 states have call successors, (1171), 650 states have call predecessors, (1171), 665 states have return successors, (5419), 1114 states have call predecessors, (5419), 1171 states have call successors, (5419) [2021-11-06 21:31:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19870 states to 19870 states and 30743 transitions. [2021-11-06 21:31:39,278 INFO L78 Accepts]: Start accepts. Automaton has 19870 states and 30743 transitions. Word has length 57 [2021-11-06 21:31:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:39,279 INFO L470 AbstractCegarLoop]: Abstraction has 19870 states and 30743 transitions. [2021-11-06 21:31:39,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 19870 states and 30743 transitions. [2021-11-06 21:31:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-06 21:31:39,280 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:39,280 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:39,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-06 21:31:39,281 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:39,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:39,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1528010612, now seen corresponding path program 1 times [2021-11-06 21:31:39,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:39,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7345342] [2021-11-06 21:31:39,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:39,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:39,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:39,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7345342] [2021-11-06 21:31:39,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7345342] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:39,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:39,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:39,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036058229] [2021-11-06 21:31:39,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:39,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:39,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:39,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:39,435 INFO L87 Difference]: Start difference. First operand 19870 states and 30743 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:40,210 INFO L93 Difference]: Finished difference Result 19870 states and 30743 transitions. [2021-11-06 21:31:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:40,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-11-06 21:31:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:40,265 INFO L225 Difference]: With dead ends: 19870 [2021-11-06 21:31:40,266 INFO L226 Difference]: Without dead ends: 19866 [2021-11-06 21:31:40,278 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:40,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19866 states. [2021-11-06 21:31:41,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19866 to 19866. [2021-11-06 21:31:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19866 states, 17956 states have (on average 1.3448986411227444) internal successors, (24149), 18335 states have internal predecessors, (24149), 1171 states have call successors, (1171), 650 states have call predecessors, (1171), 665 states have return successors, (5419), 1114 states have call predecessors, (5419), 1171 states have call successors, (5419) [2021-11-06 21:31:41,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19866 states to 19866 states and 30739 transitions. [2021-11-06 21:31:41,439 INFO L78 Accepts]: Start accepts. Automaton has 19866 states and 30739 transitions. Word has length 59 [2021-11-06 21:31:41,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:41,440 INFO L470 AbstractCegarLoop]: Abstraction has 19866 states and 30739 transitions. [2021-11-06 21:31:41,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 19866 states and 30739 transitions. [2021-11-06 21:31:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-06 21:31:41,441 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:41,441 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:41,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-06 21:31:41,442 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ipmi_timeout_handlerErr7ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:41,442 INFO L85 PathProgramCache]: Analyzing trace with hash 517713681, now seen corresponding path program 1 times [2021-11-06 21:31:41,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:41,442 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824056414] [2021-11-06 21:31:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:41,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:41,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:41,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824056414] [2021-11-06 21:31:41,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824056414] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:31:41,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564432221] [2021-11-06 21:31:41,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:41,637 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:31:41,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-06 21:31:41,639 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) [2021-11-06 21:31:41,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-06 21:31:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:42,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 4839 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-06 21:31:43,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-06 21:31:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:43,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564432221] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-06 21:31:43,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-06 21:31:43,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-11-06 21:31:43,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331549155] [2021-11-06 21:31:43,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:31:43,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:43,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:31:43,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:43,163 INFO L87 Difference]: Start difference. First operand 19866 states and 30739 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:44,221 INFO L93 Difference]: Finished difference Result 37131 states and 60201 transitions. [2021-11-06 21:31:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:44,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-11-06 21:31:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:44,291 INFO L225 Difference]: With dead ends: 37131 [2021-11-06 21:31:44,291 INFO L226 Difference]: Without dead ends: 21126 [2021-11-06 21:31:44,387 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21126 states. [2021-11-06 21:31:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21126 to 20490. [2021-11-06 21:31:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20490 states, 18572 states have (on average 1.344658625888434) internal successors, (24973), 18959 states have internal predecessors, (24973), 1179 states have call successors, (1179), 650 states have call predecessors, (1179), 665 states have return successors, (5427), 1122 states have call predecessors, (5427), 1179 states have call successors, (5427) [2021-11-06 21:31:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20490 states to 20490 states and 31579 transitions. [2021-11-06 21:31:45,772 INFO L78 Accepts]: Start accepts. Automaton has 20490 states and 31579 transitions. Word has length 67 [2021-11-06 21:31:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:45,773 INFO L470 AbstractCegarLoop]: Abstraction has 20490 states and 31579 transitions. [2021-11-06 21:31:45,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:45,773 INFO L276 IsEmpty]: Start isEmpty. Operand 20490 states and 31579 transitions. [2021-11-06 21:31:45,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-06 21:31:45,774 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:45,775 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:45,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-06 21:31:45,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-06 21:31:45,989 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:45,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:45,990 INFO L85 PathProgramCache]: Analyzing trace with hash 460914000, now seen corresponding path program 1 times [2021-11-06 21:31:45,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:45,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612632829] [2021-11-06 21:31:45,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:45,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:46,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:46,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:46,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612632829] [2021-11-06 21:31:46,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612632829] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:46,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:46,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:46,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119463609] [2021-11-06 21:31:46,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:46,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:46,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:46,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:46,158 INFO L87 Difference]: Start difference. First operand 20490 states and 31579 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:47,022 INFO L93 Difference]: Finished difference Result 20490 states and 31579 transitions. [2021-11-06 21:31:47,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:47,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-11-06 21:31:47,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:47,081 INFO L225 Difference]: With dead ends: 20490 [2021-11-06 21:31:47,081 INFO L226 Difference]: Without dead ends: 20486 [2021-11-06 21:31:47,096 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2021-11-06 21:31:48,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20486. [2021-11-06 21:31:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20486 states, 18570 states have (on average 1.3445880452342487) internal successors, (24969), 18955 states have internal predecessors, (24969), 1179 states have call successors, (1179), 650 states have call predecessors, (1179), 665 states have return successors, (5427), 1122 states have call predecessors, (5427), 1179 states have call successors, (5427) [2021-11-06 21:31:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20486 states to 20486 states and 31575 transitions. [2021-11-06 21:31:48,278 INFO L78 Accepts]: Start accepts. Automaton has 20486 states and 31575 transitions. Word has length 61 [2021-11-06 21:31:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:48,278 INFO L470 AbstractCegarLoop]: Abstraction has 20486 states and 31575 transitions. [2021-11-06 21:31:48,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 20486 states and 31575 transitions. [2021-11-06 21:31:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-06 21:31:48,280 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:48,280 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:48,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-06 21:31:48,281 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting handle_read_event_rspErr0ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:48,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:48,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1835117517, now seen corresponding path program 1 times [2021-11-06 21:31:48,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:48,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110684866] [2021-11-06 21:31:48,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:48,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:48,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:48,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110684866] [2021-11-06 21:31:48,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110684866] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:48,517 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:48,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:48,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329465621] [2021-11-06 21:31:48,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:48,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:48,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:48,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:48,518 INFO L87 Difference]: Start difference. First operand 20486 states and 31575 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:49,811 INFO L93 Difference]: Finished difference Result 29550 states and 46795 transitions. [2021-11-06 21:31:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:31:49,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-06 21:31:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:50,047 INFO L225 Difference]: With dead ends: 29550 [2021-11-06 21:31:50,047 INFO L226 Difference]: Without dead ends: 29548 [2021-11-06 21:31:50,056 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:50,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29548 states. [2021-11-06 21:31:51,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29548 to 29362. [2021-11-06 21:31:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29362 states, 26642 states have (on average 1.3520381352751294) internal successors, (36021), 27171 states have internal predecessors, (36021), 1687 states have call successors, (1687), 934 states have call predecessors, (1687), 961 states have return successors, (8945), 1598 states have call predecessors, (8945), 1687 states have call successors, (8945) [2021-11-06 21:31:51,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29362 states to 29362 states and 46653 transitions. [2021-11-06 21:31:51,709 INFO L78 Accepts]: Start accepts. Automaton has 29362 states and 46653 transitions. Word has length 70 [2021-11-06 21:31:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:51,709 INFO L470 AbstractCegarLoop]: Abstraction has 29362 states and 46653 transitions. [2021-11-06 21:31:51,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 29362 states and 46653 transitions. [2021-11-06 21:31:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-06 21:31:51,711 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:51,711 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:51,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-06 21:31:51,712 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:51,712 INFO L85 PathProgramCache]: Analyzing trace with hash 557019764, now seen corresponding path program 1 times [2021-11-06 21:31:51,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:51,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100945985] [2021-11-06 21:31:51,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:51,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:51,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:51,867 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100945985] [2021-11-06 21:31:51,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100945985] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:51,867 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:51,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:31:51,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221517490] [2021-11-06 21:31:51,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:31:51,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:51,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:31:51,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:31:51,870 INFO L87 Difference]: Start difference. First operand 29362 states and 46653 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:53,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:53,311 INFO L93 Difference]: Finished difference Result 29362 states and 46653 transitions. [2021-11-06 21:31:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:31:53,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-11-06 21:31:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:53,396 INFO L225 Difference]: With dead ends: 29362 [2021-11-06 21:31:53,396 INFO L226 Difference]: Without dead ends: 28269 [2021-11-06 21:31:53,415 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:53,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28269 states. [2021-11-06 21:31:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28269 to 28269. [2021-11-06 21:31:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28269 states, 25551 states have (on average 1.363508277562522) internal successors, (34839), 26078 states have internal predecessors, (34839), 1687 states have call successors, (1687), 934 states have call predecessors, (1687), 961 states have return successors, (8945), 1598 states have call predecessors, (8945), 1687 states have call successors, (8945) [2021-11-06 21:31:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28269 states to 28269 states and 45471 transitions. [2021-11-06 21:31:55,209 INFO L78 Accepts]: Start accepts. Automaton has 28269 states and 45471 transitions. Word has length 63 [2021-11-06 21:31:55,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:31:55,209 INFO L470 AbstractCegarLoop]: Abstraction has 28269 states and 45471 transitions. [2021-11-06 21:31:55,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 28269 states and 45471 transitions. [2021-11-06 21:31:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-11-06 21:31:55,211 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:31:55,211 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:31:55,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-06 21:31:55,212 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting handle_new_recv_msgsErr4ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:31:55,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:31:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash 519220844, now seen corresponding path program 1 times [2021-11-06 21:31:55,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:31:55,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66178810] [2021-11-06 21:31:55,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:31:55,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:31:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:31:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:31:55,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:31:55,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66178810] [2021-11-06 21:31:55,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66178810] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:31:55,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:31:55,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:31:55,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350781286] [2021-11-06 21:31:55,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:31:55,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:31:55,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:31:55,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:31:55,435 INFO L87 Difference]: Start difference. First operand 28269 states and 45471 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:31:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:31:59,833 INFO L93 Difference]: Finished difference Result 30823 states and 49062 transitions. [2021-11-06 21:31:59,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:31:59,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2021-11-06 21:31:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:31:59,923 INFO L225 Difference]: With dead ends: 30823 [2021-11-06 21:31:59,923 INFO L226 Difference]: Without dead ends: 30821 [2021-11-06 21:31:59,938 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:31:59,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30821 states. [2021-11-06 21:32:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30821 to 28277. [2021-11-06 21:32:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28277 states, 25559 states have (on average 1.3633944990023084) internal successors, (34847), 26086 states have internal predecessors, (34847), 1687 states have call successors, (1687), 934 states have call predecessors, (1687), 961 states have return successors, (8945), 1598 states have call predecessors, (8945), 1687 states have call successors, (8945) [2021-11-06 21:32:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28277 states to 28277 states and 45479 transitions. [2021-11-06 21:32:01,773 INFO L78 Accepts]: Start accepts. Automaton has 28277 states and 45479 transitions. Word has length 70 [2021-11-06 21:32:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:32:01,774 INFO L470 AbstractCegarLoop]: Abstraction has 28277 states and 45479 transitions. [2021-11-06 21:32:01,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:32:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 28277 states and 45479 transitions. [2021-11-06 21:32:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-06 21:32:01,776 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:32:01,776 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:32:01,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-06 21:32:01,776 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:32:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:32:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2009042104, now seen corresponding path program 1 times [2021-11-06 21:32:01,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:32:01,776 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123563320] [2021-11-06 21:32:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:32:01,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:32:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:32:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:32:02,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:32:02,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123563320] [2021-11-06 21:32:02,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123563320] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:32:02,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:32:02,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:32:02,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286436062] [2021-11-06 21:32:02,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:32:02,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:32:02,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:32:02,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:32:02,054 INFO L87 Difference]: Start difference. First operand 28277 states and 45479 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:32:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:32:03,764 INFO L93 Difference]: Finished difference Result 57019 states and 91457 transitions. [2021-11-06 21:32:03,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:32:03,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-11-06 21:32:03,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:32:03,861 INFO L225 Difference]: With dead ends: 57019 [2021-11-06 21:32:03,861 INFO L226 Difference]: Without dead ends: 28756 [2021-11-06 21:32:03,961 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:32:03,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28756 states. [2021-11-06 21:32:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28756 to 28277. [2021-11-06 21:32:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28277 states, 25559 states have (on average 1.363355373840917) internal successors, (34846), 26086 states have internal predecessors, (34846), 1687 states have call successors, (1687), 934 states have call predecessors, (1687), 961 states have return successors, (8945), 1598 states have call predecessors, (8945), 1687 states have call successors, (8945) [2021-11-06 21:32:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28277 states to 28277 states and 45478 transitions. [2021-11-06 21:32:05,692 INFO L78 Accepts]: Start accepts. Automaton has 28277 states and 45478 transitions. Word has length 71 [2021-11-06 21:32:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:32:05,692 INFO L470 AbstractCegarLoop]: Abstraction has 28277 states and 45478 transitions. [2021-11-06 21:32:05,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:32:05,693 INFO L276 IsEmpty]: Start isEmpty. Operand 28277 states and 45478 transitions. [2021-11-06 21:32:05,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 21:32:05,694 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:32:05,694 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:32:05,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-06 21:32:05,695 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:32:05,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:32:05,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1990512157, now seen corresponding path program 1 times [2021-11-06 21:32:05,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:32:05,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046311963] [2021-11-06 21:32:05,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:32:05,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:32:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:32:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:32:07,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:32:07,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046311963] [2021-11-06 21:32:07,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046311963] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:32:07,733 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:32:07,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:32:07,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258694338] [2021-11-06 21:32:07,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:32:07,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:32:07,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:32:07,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:32:07,737 INFO L87 Difference]: Start difference. First operand 28277 states and 45478 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:32:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:32:09,098 INFO L93 Difference]: Finished difference Result 28895 states and 46537 transitions. [2021-11-06 21:32:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-06 21:32:09,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-06 21:32:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:32:09,170 INFO L225 Difference]: With dead ends: 28895 [2021-11-06 21:32:09,170 INFO L226 Difference]: Without dead ends: 28893 [2021-11-06 21:32:09,182 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:32:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28893 states. [2021-11-06 21:32:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28893 to 28275. [2021-11-06 21:32:10,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28275 states, 25558 states have (on average 1.3624305501212928) internal successors, (34821), 26084 states have internal predecessors, (34821), 1687 states have call successors, (1687), 934 states have call predecessors, (1687), 961 states have return successors, (8945), 1598 states have call predecessors, (8945), 1687 states have call successors, (8945) [2021-11-06 21:32:10,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28275 states to 28275 states and 45453 transitions. [2021-11-06 21:32:10,894 INFO L78 Accepts]: Start accepts. Automaton has 28275 states and 45453 transitions. Word has length 76 [2021-11-06 21:32:10,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:32:10,894 INFO L470 AbstractCegarLoop]: Abstraction has 28275 states and 45453 transitions. [2021-11-06 21:32:10,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:32:10,895 INFO L276 IsEmpty]: Start isEmpty. Operand 28275 states and 45453 transitions. [2021-11-06 21:32:10,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 21:32:10,896 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:32:10,896 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-06 21:32:10,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-06 21:32:10,897 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ipmi_timeout_handlerErr7ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:32:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:32:10,897 INFO L85 PathProgramCache]: Analyzing trace with hash 595174307, now seen corresponding path program 1 times [2021-11-06 21:32:10,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:32:10,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30890198] [2021-11-06 21:32:10,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:32:10,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:32:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:32:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-06 21:32:11,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:32:11,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30890198] [2021-11-06 21:32:11,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30890198] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:32:11,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:32:11,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-06 21:32:11,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958750571] [2021-11-06 21:32:11,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:32:11,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:32:11,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:32:11,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:32:11,074 INFO L87 Difference]: Start difference. First operand 28275 states and 45453 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:32:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:32:14,770 INFO L93 Difference]: Finished difference Result 29999 states and 48085 transitions. [2021-11-06 21:32:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:32:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-11-06 21:32:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:32:14,967 INFO L225 Difference]: With dead ends: 29999 [2021-11-06 21:32:14,967 INFO L226 Difference]: Without dead ends: 29995 [2021-11-06 21:32:14,975 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:32:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29995 states. [2021-11-06 21:32:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29995 to 28271. [2021-11-06 21:32:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28271 states, 25556 states have (on average 1.3610502426044764) internal successors, (34783), 26080 states have internal predecessors, (34783), 1687 states have call successors, (1687), 934 states have call predecessors, (1687), 961 states have return successors, (8945), 1598 states have call predecessors, (8945), 1687 states have call successors, (8945) [2021-11-06 21:32:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28271 states to 28271 states and 45415 transitions. [2021-11-06 21:32:16,789 INFO L78 Accepts]: Start accepts. Automaton has 28271 states and 45415 transitions. Word has length 76 [2021-11-06 21:32:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:32:16,790 INFO L470 AbstractCegarLoop]: Abstraction has 28271 states and 45415 transitions. [2021-11-06 21:32:16,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:32:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 28271 states and 45415 transitions. [2021-11-06 21:32:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 21:32:16,792 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:32:16,792 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:32:16,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-06 21:32:16,792 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting handle_ipmb_get_msg_rspErr0ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:32:16,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:32:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1128636461, now seen corresponding path program 1 times [2021-11-06 21:32:16,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:32:16,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063069615] [2021-11-06 21:32:16,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:32:16,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:32:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:32:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:32:17,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:32:17,001 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063069615] [2021-11-06 21:32:17,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063069615] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:32:17,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:32:17,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:32:17,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754104966] [2021-11-06 21:32:17,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:32:17,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:32:17,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:32:17,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:32:17,003 INFO L87 Difference]: Start difference. First operand 28271 states and 45415 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:32:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:32:18,659 INFO L93 Difference]: Finished difference Result 29653 states and 47838 transitions. [2021-11-06 21:32:18,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:32:18,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-06 21:32:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:32:18,739 INFO L225 Difference]: With dead ends: 29653 [2021-11-06 21:32:18,739 INFO L226 Difference]: Without dead ends: 29651 [2021-11-06 21:32:18,751 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:32:18,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29651 states. [2021-11-06 21:32:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29651 to 28283. [2021-11-06 21:32:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28283 states, 25568 states have (on average 1.3607243429286608) internal successors, (34791), 26092 states have internal predecessors, (34791), 1687 states have call successors, (1687), 934 states have call predecessors, (1687), 961 states have return successors, (8945), 1598 states have call predecessors, (8945), 1687 states have call successors, (8945) [2021-11-06 21:32:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28283 states to 28283 states and 45423 transitions. [2021-11-06 21:32:20,515 INFO L78 Accepts]: Start accepts. Automaton has 28283 states and 45423 transitions. Word has length 79 [2021-11-06 21:32:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:32:20,515 INFO L470 AbstractCegarLoop]: Abstraction has 28283 states and 45423 transitions. [2021-11-06 21:32:20,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:32:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 28283 states and 45423 transitions. [2021-11-06 21:32:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-06 21:32:20,518 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:32:20,518 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:32:20,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-06 21:32:20,518 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting handle_lan_get_msg_rspErr0ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:32:20,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:32:20,518 INFO L85 PathProgramCache]: Analyzing trace with hash -857300917, now seen corresponding path program 1 times [2021-11-06 21:32:20,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:32:20,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270775272] [2021-11-06 21:32:20,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:32:20,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:32:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:32:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:32:20,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:32:20,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270775272] [2021-11-06 21:32:20,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270775272] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:32:20,719 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:32:20,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-06 21:32:20,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220776374] [2021-11-06 21:32:20,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-06 21:32:20,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:32:20,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-06 21:32:20,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-06 21:32:20,720 INFO L87 Difference]: Start difference. First operand 28283 states and 45423 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:32:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:32:22,578 INFO L93 Difference]: Finished difference Result 29651 states and 47821 transitions. [2021-11-06 21:32:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-06 21:32:22,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-11-06 21:32:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:32:22,660 INFO L225 Difference]: With dead ends: 29651 [2021-11-06 21:32:22,660 INFO L226 Difference]: Without dead ends: 29649 [2021-11-06 21:32:22,675 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:32:22,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29649 states. [2021-11-06 21:32:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29649 to 28295. [2021-11-06 21:32:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28295 states, 25580 states have (on average 1.3603987490226739) internal successors, (34799), 26104 states have internal predecessors, (34799), 1687 states have call successors, (1687), 934 states have call predecessors, (1687), 961 states have return successors, (8945), 1598 states have call predecessors, (8945), 1687 states have call successors, (8945) [2021-11-06 21:32:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28295 states to 28295 states and 45431 transitions. [2021-11-06 21:32:24,452 INFO L78 Accepts]: Start accepts. Automaton has 28295 states and 45431 transitions. Word has length 80 [2021-11-06 21:32:24,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:32:24,453 INFO L470 AbstractCegarLoop]: Abstraction has 28295 states and 45431 transitions. [2021-11-06 21:32:24,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:32:24,453 INFO L276 IsEmpty]: Start isEmpty. Operand 28295 states and 45431 transitions. [2021-11-06 21:32:24,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 21:32:24,455 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:32:24,455 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:32:24,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-06 21:32:24,455 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting i_ipmi_requestErr0ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:32:24,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:32:24,456 INFO L85 PathProgramCache]: Analyzing trace with hash -93327301, now seen corresponding path program 1 times [2021-11-06 21:32:24,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:32:24,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631697459] [2021-11-06 21:32:24,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:32:24,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:32:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:32:24,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-06 21:32:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:32:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:32:24,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:32:24,735 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631697459] [2021-11-06 21:32:24,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631697459] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:32:24,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:32:24,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 21:32:24,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029617067] [2021-11-06 21:32:24,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 21:32:24,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:32:24,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 21:32:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:32:24,737 INFO L87 Difference]: Start difference. First operand 28295 states and 45431 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:32:46,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:32:46,002 INFO L93 Difference]: Finished difference Result 81791 states and 155130 transitions. [2021-11-06 21:32:46,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-06 21:32:46,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2021-11-06 21:32:46,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:32:46,274 INFO L225 Difference]: With dead ends: 81791 [2021-11-06 21:32:46,275 INFO L226 Difference]: Without dead ends: 53662 [2021-11-06 21:32:46,638 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-11-06 21:32:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53662 states. [2021-11-06 21:32:50,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53662 to 47365. [2021-11-06 21:32:50,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47365 states, 42306 states have (on average 1.3587907152649743) internal successors, (57485), 43490 states have internal predecessors, (57485), 2791 states have call successors, (2791), 1386 states have call predecessors, (2791), 2201 states have return successors, (19645), 3060 states have call predecessors, (19645), 2791 states have call successors, (19645) [2021-11-06 21:32:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47365 states to 47365 states and 79921 transitions. [2021-11-06 21:32:50,426 INFO L78 Accepts]: Start accepts. Automaton has 47365 states and 79921 transitions. Word has length 73 [2021-11-06 21:32:50,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:32:50,426 INFO L470 AbstractCegarLoop]: Abstraction has 47365 states and 79921 transitions. [2021-11-06 21:32:50,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:32:50,427 INFO L276 IsEmpty]: Start isEmpty. Operand 47365 states and 79921 transitions. [2021-11-06 21:32:50,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-06 21:32:50,429 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:32:50,429 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:32:50,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-06 21:32:50,429 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting i_ipmi_requestErr0ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:32:50,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:32:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash -93267719, now seen corresponding path program 1 times [2021-11-06 21:32:50,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:32:50,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714400419] [2021-11-06 21:32:50,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:32:50,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:32:50,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:32:50,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-06 21:32:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:32:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:32:50,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:32:50,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714400419] [2021-11-06 21:32:50,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714400419] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:32:50,628 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:32:50,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-06 21:32:50,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487717455] [2021-11-06 21:32:50,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-06 21:32:50,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:32:50,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-06 21:32:50,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-06 21:32:50,630 INFO L87 Difference]: Start difference. First operand 47365 states and 79921 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:33:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:10,081 INFO L93 Difference]: Finished difference Result 60738 states and 102419 transitions. [2021-11-06 21:33:10,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-06 21:33:10,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2021-11-06 21:33:10,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:10,317 INFO L225 Difference]: With dead ends: 60738 [2021-11-06 21:33:10,318 INFO L226 Difference]: Without dead ends: 60734 [2021-11-06 21:33:10,357 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-06 21:33:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60734 states. [2021-11-06 21:33:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60734 to 47477. [2021-11-06 21:33:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47477 states, 42418 states have (on average 1.3572775708425668) internal successors, (57573), 43602 states have internal predecessors, (57573), 2791 states have call successors, (2791), 1386 states have call predecessors, (2791), 2201 states have return successors, (19645), 3060 states have call predecessors, (19645), 2791 states have call successors, (19645) [2021-11-06 21:33:14,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47477 states to 47477 states and 80009 transitions. [2021-11-06 21:33:14,203 INFO L78 Accepts]: Start accepts. Automaton has 47477 states and 80009 transitions. Word has length 73 [2021-11-06 21:33:14,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:14,203 INFO L470 AbstractCegarLoop]: Abstraction has 47477 states and 80009 transitions. [2021-11-06 21:33:14,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-06 21:33:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 47477 states and 80009 transitions. [2021-11-06 21:33:14,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-11-06 21:33:14,207 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:14,207 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:14,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-06 21:33:14,207 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:33:14,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1269781752, now seen corresponding path program 1 times [2021-11-06 21:33:14,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:14,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353143501] [2021-11-06 21:33:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:14,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:14,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:14,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353143501] [2021-11-06 21:33:14,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353143501] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:14,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:14,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-06 21:33:14,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704449942] [2021-11-06 21:33:14,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-06 21:33:14,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:14,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-06 21:33:14,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:33:14,407 INFO L87 Difference]: Start difference. First operand 47477 states and 80009 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-06 21:33:18,254 INFO L93 Difference]: Finished difference Result 94664 states and 175966 transitions. [2021-11-06 21:33:18,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-06 21:33:18,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2021-11-06 21:33:18,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-06 21:33:18,459 INFO L225 Difference]: With dead ends: 94664 [2021-11-06 21:33:18,459 INFO L226 Difference]: Without dead ends: 47245 [2021-11-06 21:33:19,000 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-06 21:33:19,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47245 states. [2021-11-06 21:33:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47245 to 47245. [2021-11-06 21:33:22,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47245 states, 42194 states have (on average 1.348935867658909) internal successors, (56917), 43370 states have internal predecessors, (56917), 2791 states have call successors, (2791), 1386 states have call predecessors, (2791), 2201 states have return successors, (19645), 3060 states have call predecessors, (19645), 2791 states have call successors, (19645) [2021-11-06 21:33:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47245 states to 47245 states and 79353 transitions. [2021-11-06 21:33:22,621 INFO L78 Accepts]: Start accepts. Automaton has 47245 states and 79353 transitions. Word has length 79 [2021-11-06 21:33:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-06 21:33:22,622 INFO L470 AbstractCegarLoop]: Abstraction has 47245 states and 79353 transitions. [2021-11-06 21:33:22,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 2 states have internal predecessors, (72), 1 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-06 21:33:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 47245 states and 79353 transitions. [2021-11-06 21:33:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-11-06 21:33:22,625 INFO L505 BasicCegarLoop]: Found error trace [2021-11-06 21:33:22,625 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-06 21:33:22,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-06 21:33:22,625 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting i_ipmi_requestErr15ASSERT_VIOLATIONERROR_FUNCTION === [ipmi_timeout_handlerErr0ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr1ASSERT_VIOLATIONERROR_FUNCTION, ipmi_timeout_handlerErr2ASSERT_VIOLATIONERROR_FUNCTION (and 111 more)] === [2021-11-06 21:33:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-06 21:33:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash 491794808, now seen corresponding path program 1 times [2021-11-06 21:33:22,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-06 21:33:22,626 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358272426] [2021-11-06 21:33:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-06 21:33:22,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-06 21:33:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:22,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-06 21:33:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-06 21:33:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-06 21:33:22,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-06 21:33:22,858 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358272426] [2021-11-06 21:33:22,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358272426] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-06 21:33:22,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-06 21:33:22,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-06 21:33:22,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946200945] [2021-11-06 21:33:22,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-06 21:33:22,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-06 21:33:22,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-06 21:33:22,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-06 21:33:22,860 INFO L87 Difference]: Start difference. First operand 47245 states and 79353 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)