/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:02:30,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:02:30,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:02:30,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:02:30,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:02:30,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:02:30,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:02:30,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:02:30,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:02:30,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:02:30,589 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:02:30,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:02:30,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:02:30,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:02:30,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:02:30,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:02:30,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:02:30,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:02:30,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:02:30,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:02:30,596 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:02:30,597 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:02:30,597 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:02:30,598 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:02:30,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:02:30,600 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:02:30,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:02:30,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:02:30,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:02:30,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:02:30,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:02:30,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:02:30,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:02:30,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:02:30,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:02:30,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:02:30,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:02:30,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:02:30,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:02:30,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:02:30,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:02:30,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:02:30,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:02:30,619 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:02:30,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:02:30,620 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:02:30,620 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:02:30,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:02:30,621 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:02:30,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:02:30,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:02:30,621 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:02:30,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:02:30,622 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:02:30,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:02:30,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:02:30,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:02:30,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:02:30,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:02:30,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:02:30,622 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:02:30,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:02:30,623 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:02:30,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:02:30,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:02:30,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:02:30,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:02:30,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:02:30,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:02:30,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:02:30,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:02:30,624 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:02:30,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:02:30,624 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:02:30,624 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:02:30,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:02:30,625 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:02:30,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:02:30,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:02:30,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:02:30,772 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:02:30,773 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:02:30,773 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-04-27 15:02:30,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46d14c807/16cca3d202a84dc6814ba95fc81b21e6/FLAG78c2f98da [2022-04-27 15:02:31,241 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:02:31,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c [2022-04-27 15:02:31,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46d14c807/16cca3d202a84dc6814ba95fc81b21e6/FLAG78c2f98da [2022-04-27 15:02:31,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46d14c807/16cca3d202a84dc6814ba95fc81b21e6 [2022-04-27 15:02:31,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:02:31,257 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:02:31,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:02:31,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:02:31,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:02:31,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:02:31" (1/1) ... [2022-04-27 15:02:31,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3104a358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:02:31, skipping insertion in model container [2022-04-27 15:02:31,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:02:31" (1/1) ... [2022-04-27 15:02:31,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:02:31,290 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:02:31,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-04-27 15:02:31,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:02:31,547 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:02:31,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl1.cil.c[17080,17093] [2022-04-27 15:02:31,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:02:31,657 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:02:31,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:02:31 WrapperNode [2022-04-27 15:02:31,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:02:31,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:02:31,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:02:31,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:02:31,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:02:31" (1/1) ... [2022-04-27 15:02:31,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:02:31" (1/1) ... [2022-04-27 15:02:31,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:02:31" (1/1) ... [2022-04-27 15:02:31,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:02:31" (1/1) ... [2022-04-27 15:02:31,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:02:31" (1/1) ... [2022-04-27 15:02:31,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:02:31" (1/1) ... [2022-04-27 15:02:31,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:02:31" (1/1) ... [2022-04-27 15:02:31,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:02:31,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:02:31,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:02:31,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:02:31,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:02:31" (1/1) ... [2022-04-27 15:02:31,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:02:31,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:02:31,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:02:31,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:02:31,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-04-27 15:02:31,778 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-27 15:02:31,778 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:02:31,778 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-27 15:02:31,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:02:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-27 15:02:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:02:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:02:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:02:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:02:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:02:31,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:02:31,848 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:02:31,849 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:02:31,922 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:02:32,018 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume !false; [2022-04-27 15:02:32,019 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##13: assume false; [2022-04-27 15:02:32,020 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:02:32,081 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume false; [2022-04-27 15:02:32,081 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume !false; [2022-04-27 15:02:32,092 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:02:32,106 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-27 15:02:32,106 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-27 15:02:32,113 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-27 15:02:32,196 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-04-27 15:02:32,196 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-04-27 15:02:32,200 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:02:32,206 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:02:32,206 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 15:02:32,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:02:32 BoogieIcfgContainer [2022-04-27 15:02:32,208 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:02:32,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:02:32,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:02:32,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:02:32,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:02:31" (1/3) ... [2022-04-27 15:02:32,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44db55be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:02:32, skipping insertion in model container [2022-04-27 15:02:32,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:02:31" (2/3) ... [2022-04-27 15:02:32,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44db55be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:02:32, skipping insertion in model container [2022-04-27 15:02:32,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:02:32" (3/3) ... [2022-04-27 15:02:32,213 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1.cil.c [2022-04-27 15:02:32,223 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:02:32,224 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:02:32,258 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:02:32,263 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@274072d0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1ead633c [2022-04-27 15:02:32,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:02:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 15:02:32,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:02:32,276 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:32,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:02:32,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:32,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:32,280 INFO L85 PathProgramCache]: Analyzing trace with hash -657298671, now seen corresponding path program 1 times [2022-04-27 15:02:32,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:32,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444191286] [2022-04-27 15:02:32,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:32,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:32,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:32,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {154#true} is VALID [2022-04-27 15:02:32,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-27 15:02:32,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #462#return; {154#true} is VALID [2022-04-27 15:02:32,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:32,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {164#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {154#true} is VALID [2022-04-27 15:02:32,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-27 15:02:32,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {159#(= main_~status~1 0)} #442#return; {159#(= main_~status~1 0)} is VALID [2022-04-27 15:02:32,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {163#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:32,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {154#true} is VALID [2022-04-27 15:02:32,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-27 15:02:32,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #462#return; {154#true} is VALID [2022-04-27 15:02:32,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret35 := main(); {154#true} is VALID [2022-04-27 15:02:32,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {159#(= main_~status~1 0)} is VALID [2022-04-27 15:02:32,639 INFO L272 TraceCheckUtils]: 6: Hoare triple {159#(= main_~status~1 0)} call _BLAST_init(); {164#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:32,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {164#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {154#true} is VALID [2022-04-27 15:02:32,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-27 15:02:32,640 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {154#true} {159#(= main_~status~1 0)} #442#return; {159#(= main_~status~1 0)} is VALID [2022-04-27 15:02:32,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {159#(= main_~status~1 0)} assume !(~status~1 >= 0); {155#false} is VALID [2022-04-27 15:02:32,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#false} assume !(1 == ~pended~0); {155#false} is VALID [2022-04-27 15:02:32,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {155#false} assume !(1 == ~pended~0); {155#false} is VALID [2022-04-27 15:02:32,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {155#false} assume ~s~0 != ~UNLOADED~0; {155#false} is VALID [2022-04-27 15:02:32,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {155#false} assume -1 != ~status~1; {155#false} is VALID [2022-04-27 15:02:32,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {155#false} assume !(~s~0 != ~SKIP2~0); {155#false} is VALID [2022-04-27 15:02:32,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {155#false} assume 1 == ~pended~0; {155#false} is VALID [2022-04-27 15:02:32,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {155#false} assume 259 != ~status~1; {155#false} is VALID [2022-04-27 15:02:32,643 INFO L272 TraceCheckUtils]: 18: Hoare triple {155#false} call errorFn(); {155#false} is VALID [2022-04-27 15:02:32,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-27 15:02:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:32,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:32,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444191286] [2022-04-27 15:02:32,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444191286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:32,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:32,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:02:32,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682195096] [2022-04-27 15:02:32,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:32,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 15:02:32,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:32,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:02:32,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:32,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:02:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:32,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:02:32,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:02:32,710 INFO L87 Difference]: Start difference. First operand has 151 states, 113 states have (on average 1.5575221238938053) internal successors, (176), 126 states have internal predecessors, (176), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:02:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:33,626 INFO L93 Difference]: Finished difference Result 302 states and 462 transitions. [2022-04-27 15:02:33,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:02:33,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 15:02:33,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:02:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2022-04-27 15:02:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:02:33,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2022-04-27 15:02:33,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 462 transitions. [2022-04-27 15:02:34,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 462 edges. 462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:34,030 INFO L225 Difference]: With dead ends: 302 [2022-04-27 15:02:34,030 INFO L226 Difference]: Without dead ends: 157 [2022-04-27 15:02:34,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:02:34,035 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 180 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:34,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 286 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 15:02:34,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-27 15:02:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2022-04-27 15:02:34,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:34,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 15:02:34,087 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 15:02:34,088 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 15:02:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:34,099 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2022-04-27 15:02:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2022-04-27 15:02:34,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:34,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:34,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 157 states. [2022-04-27 15:02:34,107 INFO L87 Difference]: Start difference. First operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 157 states. [2022-04-27 15:02:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:34,117 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2022-04-27 15:02:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2022-04-27 15:02:34,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:34,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:34,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:34,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 105 states have (on average 1.457142857142857) internal successors, (153), 116 states have internal predecessors, (153), 24 states have call successors, (24), 12 states have call predecessors, (24), 10 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 15:02:34,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2022-04-27 15:02:34,129 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2022-04-27 15:02:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:34,129 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2022-04-27 15:02:34,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:02:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2022-04-27 15:02:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:02:34,130 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:34,130 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:34,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:02:34,131 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash 919351458, now seen corresponding path program 1 times [2022-04-27 15:02:34,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:34,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876180440] [2022-04-27 15:02:34,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:34,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:34,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:34,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {1092#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {1080#true} is VALID [2022-04-27 15:02:34,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {1080#true} assume true; {1080#true} is VALID [2022-04-27 15:02:34,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1080#true} {1080#true} #462#return; {1080#true} is VALID [2022-04-27 15:02:34,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:34,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {1093#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1080#true} is VALID [2022-04-27 15:02:34,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {1080#true} assume true; {1080#true} is VALID [2022-04-27 15:02:34,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1080#true} {1080#true} #442#return; {1080#true} is VALID [2022-04-27 15:02:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:34,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {1094#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#(= ~s~0 ~NP~0)} assume true; {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1091#(= ~s~0 ~NP~0)} {1080#true} #444#return; {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {1080#true} call ULTIMATE.init(); {1092#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:34,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {1092#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {1080#true} is VALID [2022-04-27 15:02:34,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {1080#true} assume true; {1080#true} is VALID [2022-04-27 15:02:34,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1080#true} {1080#true} #462#return; {1080#true} is VALID [2022-04-27 15:02:34,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {1080#true} call #t~ret35 := main(); {1080#true} is VALID [2022-04-27 15:02:34,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {1080#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {1080#true} is VALID [2022-04-27 15:02:34,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {1080#true} call _BLAST_init(); {1093#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:34,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {1093#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1080#true} is VALID [2022-04-27 15:02:34,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {1080#true} assume true; {1080#true} is VALID [2022-04-27 15:02:34,312 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1080#true} {1080#true} #442#return; {1080#true} is VALID [2022-04-27 15:02:34,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {1080#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {1080#true} is VALID [2022-04-27 15:02:34,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {1080#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {1080#true} is VALID [2022-04-27 15:02:34,313 INFO L272 TraceCheckUtils]: 12: Hoare triple {1080#true} call stub_driver_init(); {1094#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:34,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {1094#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {1091#(= ~s~0 ~NP~0)} assume true; {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,314 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1091#(= ~s~0 ~NP~0)} {1080#true} #444#return; {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {1091#(= ~s~0 ~NP~0)} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {1091#(= ~s~0 ~NP~0)} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {1091#(= ~s~0 ~NP~0)} assume 3 == ~tmp_ndt_1~0; {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,315 INFO L272 TraceCheckUtils]: 19: Hoare triple {1091#(= ~s~0 ~NP~0)} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {1091#(= ~s~0 ~NP~0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {1091#(= ~s~0 ~NP~0)} assume 0 == ~irpStack__MinorFunction~0; {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {1091#(= ~s~0 ~NP~0)} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {1091#(= ~s~0 ~NP~0)} is VALID [2022-04-27 15:02:34,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {1091#(= ~s~0 ~NP~0)} assume ~s~0 != ~NP~0; {1081#false} is VALID [2022-04-27 15:02:34,317 INFO L272 TraceCheckUtils]: 24: Hoare triple {1081#false} call errorFn(); {1081#false} is VALID [2022-04-27 15:02:34,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {1081#false} assume !false; {1081#false} is VALID [2022-04-27 15:02:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:34,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:34,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876180440] [2022-04-27 15:02:34,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876180440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:34,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:34,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 15:02:34,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327261094] [2022-04-27 15:02:34,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:34,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 15:02:34,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:34,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:34,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:34,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 15:02:34,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:34,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 15:02:34,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:02:34,345 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:35,372 INFO L93 Difference]: Finished difference Result 275 states and 370 transitions. [2022-04-27 15:02:35,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:02:35,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 15:02:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2022-04-27 15:02:35,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 370 transitions. [2022-04-27 15:02:35,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 370 transitions. [2022-04-27 15:02:35,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:35,664 INFO L225 Difference]: With dead ends: 275 [2022-04-27 15:02:35,665 INFO L226 Difference]: Without dead ends: 219 [2022-04-27 15:02:35,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:02:35,674 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 212 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:35,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 285 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 15:02:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-27 15:02:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2022-04-27 15:02:35,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:35,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-04-27 15:02:35,701 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-04-27 15:02:35,701 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-04-27 15:02:35,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:35,707 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2022-04-27 15:02:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2022-04-27 15:02:35,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:35,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:35,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) Second operand 219 states. [2022-04-27 15:02:35,711 INFO L87 Difference]: Start difference. First operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) Second operand 219 states. [2022-04-27 15:02:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:35,717 INFO L93 Difference]: Finished difference Result 219 states and 291 transitions. [2022-04-27 15:02:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2022-04-27 15:02:35,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:35,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:35,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:35,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 157 states have internal predecessors, (209), 25 states have call successors, (25), 18 states have call predecessors, (25), 16 states have return successors, (25), 21 states have call predecessors, (25), 18 states have call successors, (25) [2022-04-27 15:02:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 259 transitions. [2022-04-27 15:02:35,728 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 259 transitions. Word has length 26 [2022-04-27 15:02:35,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:35,729 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 259 transitions. [2022-04-27 15:02:35,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 259 transitions. [2022-04-27 15:02:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:02:35,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:35,730 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:35,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:02:35,730 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:35,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:35,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1564864640, now seen corresponding path program 1 times [2022-04-27 15:02:35,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:35,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982163096] [2022-04-27 15:02:35,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:35,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:35,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:35,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {2193#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {2181#true} is VALID [2022-04-27 15:02:35,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {2181#true} assume true; {2181#true} is VALID [2022-04-27 15:02:35,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2181#true} {2181#true} #462#return; {2181#true} is VALID [2022-04-27 15:02:35,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:35,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {2194#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {2181#true} is VALID [2022-04-27 15:02:35,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {2181#true} assume true; {2181#true} is VALID [2022-04-27 15:02:35,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2181#true} {2181#true} #442#return; {2181#true} is VALID [2022-04-27 15:02:35,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:35,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {2195#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {2192#(= ~compRegistered~0 0)} assume true; {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2192#(= ~compRegistered~0 0)} {2181#true} #444#return; {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {2181#true} call ULTIMATE.init(); {2193#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:35,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {2193#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {2181#true} is VALID [2022-04-27 15:02:35,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {2181#true} assume true; {2181#true} is VALID [2022-04-27 15:02:35,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2181#true} {2181#true} #462#return; {2181#true} is VALID [2022-04-27 15:02:35,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {2181#true} call #t~ret35 := main(); {2181#true} is VALID [2022-04-27 15:02:35,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {2181#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {2181#true} is VALID [2022-04-27 15:02:35,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {2181#true} call _BLAST_init(); {2194#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:35,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {2194#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {2181#true} is VALID [2022-04-27 15:02:35,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {2181#true} assume true; {2181#true} is VALID [2022-04-27 15:02:35,894 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2181#true} {2181#true} #442#return; {2181#true} is VALID [2022-04-27 15:02:35,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {2181#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {2181#true} is VALID [2022-04-27 15:02:35,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {2181#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {2181#true} is VALID [2022-04-27 15:02:35,895 INFO L272 TraceCheckUtils]: 12: Hoare triple {2181#true} call stub_driver_init(); {2195#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:35,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {2195#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {2192#(= ~compRegistered~0 0)} assume true; {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,896 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2192#(= ~compRegistered~0 0)} {2181#true} #444#return; {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {2192#(= ~compRegistered~0 0)} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {2192#(= ~compRegistered~0 0)} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {2192#(= ~compRegistered~0 0)} assume 3 == ~tmp_ndt_1~0; {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,899 INFO L272 TraceCheckUtils]: 19: Hoare triple {2192#(= ~compRegistered~0 0)} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {2192#(= ~compRegistered~0 0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {2192#(= ~compRegistered~0 0)} assume 0 == ~irpStack__MinorFunction~0; {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {2192#(= ~compRegistered~0 0)} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {2192#(= ~compRegistered~0 0)} assume !(~s~0 != ~NP~0); {2192#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:35,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {2192#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {2182#false} is VALID [2022-04-27 15:02:35,905 INFO L272 TraceCheckUtils]: 25: Hoare triple {2182#false} call errorFn(); {2182#false} is VALID [2022-04-27 15:02:35,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {2182#false} assume !false; {2182#false} is VALID [2022-04-27 15:02:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:35,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:35,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982163096] [2022-04-27 15:02:35,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982163096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:35,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:35,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 15:02:35,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812775971] [2022-04-27 15:02:35,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:35,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-04-27 15:02:35,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:35,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:35,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:35,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 15:02:35,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:35,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 15:02:35,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:02:35,925 INFO L87 Difference]: Start difference. First operand 195 states and 259 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:36,674 INFO L93 Difference]: Finished difference Result 316 states and 413 transitions. [2022-04-27 15:02:36,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:02:36,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-04-27 15:02:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 334 transitions. [2022-04-27 15:02:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 334 transitions. [2022-04-27 15:02:36,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 334 transitions. [2022-04-27 15:02:36,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:36,965 INFO L225 Difference]: With dead ends: 316 [2022-04-27 15:02:36,965 INFO L226 Difference]: Without dead ends: 254 [2022-04-27 15:02:36,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:02:36,966 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 325 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:36,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 251 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 15:02:36,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-27 15:02:36,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 217. [2022-04-27 15:02:36,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:36,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-27 15:02:36,981 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-27 15:02:36,981 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-27 15:02:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:36,988 INFO L93 Difference]: Finished difference Result 254 states and 335 transitions. [2022-04-27 15:02:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 335 transitions. [2022-04-27 15:02:36,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:36,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:36,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) Second operand 254 states. [2022-04-27 15:02:36,990 INFO L87 Difference]: Start difference. First operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) Second operand 254 states. [2022-04-27 15:02:36,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:36,996 INFO L93 Difference]: Finished difference Result 254 states and 335 transitions. [2022-04-27 15:02:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 335 transitions. [2022-04-27 15:02:36,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:36,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:36,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:36,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:36,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3728813559322033) internal successors, (243), 181 states have internal predecessors, (243), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-27 15:02:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 289 transitions. [2022-04-27 15:02:37,003 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 289 transitions. Word has length 27 [2022-04-27 15:02:37,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:37,003 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 289 transitions. [2022-04-27 15:02:37,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 289 transitions. [2022-04-27 15:02:37,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 15:02:37,004 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:37,004 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:37,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:02:37,004 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:37,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:37,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1424448937, now seen corresponding path program 1 times [2022-04-27 15:02:37,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:37,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834453346] [2022-04-27 15:02:37,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:37,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:37,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:37,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {3436#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {3424#true} is VALID [2022-04-27 15:02:37,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-27 15:02:37,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3424#true} {3424#true} #462#return; {3424#true} is VALID [2022-04-27 15:02:37,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:37,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {3437#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {3424#true} is VALID [2022-04-27 15:02:37,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-27 15:02:37,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3424#true} {3424#true} #442#return; {3424#true} is VALID [2022-04-27 15:02:37,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:37,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {3438#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {3424#true} is VALID [2022-04-27 15:02:37,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-27 15:02:37,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3424#true} {3424#true} #444#return; {3424#true} is VALID [2022-04-27 15:02:37,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {3424#true} call ULTIMATE.init(); {3436#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:37,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {3436#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {3424#true} is VALID [2022-04-27 15:02:37,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-27 15:02:37,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3424#true} {3424#true} #462#return; {3424#true} is VALID [2022-04-27 15:02:37,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {3424#true} call #t~ret35 := main(); {3424#true} is VALID [2022-04-27 15:02:37,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {3424#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {3424#true} is VALID [2022-04-27 15:02:37,118 INFO L272 TraceCheckUtils]: 6: Hoare triple {3424#true} call _BLAST_init(); {3437#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:37,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {3437#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {3424#true} is VALID [2022-04-27 15:02:37,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-27 15:02:37,118 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {3424#true} {3424#true} #442#return; {3424#true} is VALID [2022-04-27 15:02:37,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {3424#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {3424#true} is VALID [2022-04-27 15:02:37,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {3424#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {3424#true} is VALID [2022-04-27 15:02:37,119 INFO L272 TraceCheckUtils]: 12: Hoare triple {3424#true} call stub_driver_init(); {3438#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:37,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {3438#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {3424#true} is VALID [2022-04-27 15:02:37,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {3424#true} assume true; {3424#true} is VALID [2022-04-27 15:02:37,120 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3424#true} {3424#true} #444#return; {3424#true} is VALID [2022-04-27 15:02:37,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {3424#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {3424#true} is VALID [2022-04-27 15:02:37,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {3424#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {3424#true} is VALID [2022-04-27 15:02:37,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {3424#true} assume 3 == ~tmp_ndt_1~0; {3424#true} is VALID [2022-04-27 15:02:37,120 INFO L272 TraceCheckUtils]: 19: Hoare triple {3424#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {3424#true} is VALID [2022-04-27 15:02:37,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {3424#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {3424#true} is VALID [2022-04-27 15:02:37,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {3424#true} assume !(0 == ~irpStack__MinorFunction~0); {3424#true} is VALID [2022-04-27 15:02:37,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {3424#true} assume 23 == ~irpStack__MinorFunction~0; {3424#true} is VALID [2022-04-27 15:02:37,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {3424#true} ~devExt__SurpriseRemoved~0 := 1; {3424#true} is VALID [2022-04-27 15:02:37,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {3424#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {3435#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:37,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {3435#(= ~SKIP1~0 ~s~0)} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {3435#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:37,128 INFO L272 TraceCheckUtils]: 26: Hoare triple {3435#(= ~SKIP1~0 ~s~0)} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {3435#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:37,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {3435#(= ~SKIP1~0 ~s~0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {3435#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:37,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {3435#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {3435#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:37,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {3435#(= ~SKIP1~0 ~s~0)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {3435#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:37,130 INFO L290 TraceCheckUtils]: 30: Hoare triple {3435#(= ~SKIP1~0 ~s~0)} assume 0 == ~tmp_ndt_2~0; {3435#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:37,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {3435#(= ~SKIP1~0 ~s~0)} ~returnVal2~0 := 0; {3435#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:37,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {3435#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {3435#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:37,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {3435#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {3435#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:37,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {3435#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {3425#false} is VALID [2022-04-27 15:02:37,131 INFO L272 TraceCheckUtils]: 35: Hoare triple {3425#false} call errorFn(); {3425#false} is VALID [2022-04-27 15:02:37,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {3425#false} assume !false; {3425#false} is VALID [2022-04-27 15:02:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:37,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834453346] [2022-04-27 15:02:37,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834453346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:37,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:37,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 15:02:37,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139971208] [2022-04-27 15:02:37,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:37,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-04-27 15:02:37,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:37,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:37,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:37,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 15:02:37,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:37,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 15:02:37,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:02:37,155 INFO L87 Difference]: Start difference. First operand 217 states and 289 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:38,043 INFO L93 Difference]: Finished difference Result 220 states and 291 transitions. [2022-04-27 15:02:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:02:38,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-04-27 15:02:38,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2022-04-27 15:02:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2022-04-27 15:02:38,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 214 transitions. [2022-04-27 15:02:38,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:38,215 INFO L225 Difference]: With dead ends: 220 [2022-04-27 15:02:38,215 INFO L226 Difference]: Without dead ends: 217 [2022-04-27 15:02:38,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:02:38,216 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 102 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:38,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 247 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 15:02:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-27 15:02:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-04-27 15:02:38,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:38,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-27 15:02:38,226 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-27 15:02:38,226 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-27 15:02:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:38,231 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2022-04-27 15:02:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-27 15:02:38,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:38,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:38,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) Second operand 217 states. [2022-04-27 15:02:38,233 INFO L87 Difference]: Start difference. First operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) Second operand 217 states. [2022-04-27 15:02:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:38,238 INFO L93 Difference]: Finished difference Result 217 states and 288 transitions. [2022-04-27 15:02:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-27 15:02:38,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:38,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:38,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:38,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3672316384180792) internal successors, (242), 181 states have internal predecessors, (242), 21 states have call successors, (21), 16 states have call predecessors, (21), 18 states have return successors, (25), 20 states have call predecessors, (25), 16 states have call successors, (25) [2022-04-27 15:02:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 288 transitions. [2022-04-27 15:02:38,244 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 288 transitions. Word has length 37 [2022-04-27 15:02:38,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:38,244 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 288 transitions. [2022-04-27 15:02:38,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 15:02:38,244 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 288 transitions. [2022-04-27 15:02:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 15:02:38,245 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:38,245 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:38,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:02:38,245 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:38,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:38,246 INFO L85 PathProgramCache]: Analyzing trace with hash -327288786, now seen corresponding path program 1 times [2022-04-27 15:02:38,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:38,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326055707] [2022-04-27 15:02:38,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:38,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:38,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:38,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {4485#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {4463#true} is VALID [2022-04-27 15:02:38,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {4463#true} assume true; {4463#true} is VALID [2022-04-27 15:02:38,321 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4463#true} {4463#true} #462#return; {4463#true} is VALID [2022-04-27 15:02:38,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:38,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {4486#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {4463#true} is VALID [2022-04-27 15:02:38,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {4463#true} assume true; {4463#true} is VALID [2022-04-27 15:02:38,342 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4463#true} {4463#true} #442#return; {4463#true} is VALID [2022-04-27 15:02:38,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:38,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {4487#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {4463#true} is VALID [2022-04-27 15:02:38,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {4463#true} assume true; {4463#true} is VALID [2022-04-27 15:02:38,355 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4463#true} {4463#true} #444#return; {4463#true} is VALID [2022-04-27 15:02:38,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 15:02:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:38,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {4488#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {4463#true} is VALID [2022-04-27 15:02:38,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {4463#true} assume !(0 != ~compRegistered~0); {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {4489#(= ~compRegistered~0 0)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {4489#(= ~compRegistered~0 0)} assume 0 == ~tmp_ndt_2~0; {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,375 INFO L290 TraceCheckUtils]: 4: Hoare triple {4489#(= ~compRegistered~0 0)} ~returnVal2~0 := 0; {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {4489#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {4489#(= ~compRegistered~0 0)} #res := ~returnVal2~0; {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {4489#(= ~compRegistered~0 0)} assume true; {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,376 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {4489#(= ~compRegistered~0 0)} {4475#(not (= ~compRegistered~0 0))} #470#return; {4464#false} is VALID [2022-04-27 15:02:38,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {4463#true} call ULTIMATE.init(); {4485#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:38,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {4485#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {4463#true} is VALID [2022-04-27 15:02:38,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {4463#true} assume true; {4463#true} is VALID [2022-04-27 15:02:38,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4463#true} {4463#true} #462#return; {4463#true} is VALID [2022-04-27 15:02:38,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {4463#true} call #t~ret35 := main(); {4463#true} is VALID [2022-04-27 15:02:38,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {4463#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {4463#true} is VALID [2022-04-27 15:02:38,379 INFO L272 TraceCheckUtils]: 6: Hoare triple {4463#true} call _BLAST_init(); {4486#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:38,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {4486#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {4463#true} is VALID [2022-04-27 15:02:38,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {4463#true} assume true; {4463#true} is VALID [2022-04-27 15:02:38,379 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4463#true} {4463#true} #442#return; {4463#true} is VALID [2022-04-27 15:02:38,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {4463#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {4463#true} is VALID [2022-04-27 15:02:38,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {4463#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {4463#true} is VALID [2022-04-27 15:02:38,379 INFO L272 TraceCheckUtils]: 12: Hoare triple {4463#true} call stub_driver_init(); {4487#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:38,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {4487#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {4463#true} is VALID [2022-04-27 15:02:38,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {4463#true} assume true; {4463#true} is VALID [2022-04-27 15:02:38,380 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4463#true} {4463#true} #444#return; {4463#true} is VALID [2022-04-27 15:02:38,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {4463#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {4474#(= main_~__cil_tmp8~0 1)} is VALID [2022-04-27 15:02:38,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {4474#(= main_~__cil_tmp8~0 1)} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {4463#true} is VALID [2022-04-27 15:02:38,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {4463#true} assume 3 == ~tmp_ndt_1~0; {4463#true} is VALID [2022-04-27 15:02:38,380 INFO L272 TraceCheckUtils]: 19: Hoare triple {4463#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {4463#true} is VALID [2022-04-27 15:02:38,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {4463#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {4463#true} is VALID [2022-04-27 15:02:38,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {4463#true} assume 0 == ~irpStack__MinorFunction~0; {4463#true} is VALID [2022-04-27 15:02:38,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {4463#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {4463#true} is VALID [2022-04-27 15:02:38,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {4463#true} assume !(~s~0 != ~NP~0); {4463#true} is VALID [2022-04-27 15:02:38,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {4463#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {4475#(not (= ~compRegistered~0 0))} is VALID [2022-04-27 15:02:38,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {4475#(not (= ~compRegistered~0 0))} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {4475#(not (= ~compRegistered~0 0))} is VALID [2022-04-27 15:02:38,383 INFO L272 TraceCheckUtils]: 26: Hoare triple {4475#(not (= ~compRegistered~0 0))} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {4488#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:38,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {4488#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {4463#true} is VALID [2022-04-27 15:02:38,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {4463#true} assume !(0 != ~compRegistered~0); {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {4489#(= ~compRegistered~0 0)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {4489#(= ~compRegistered~0 0)} assume 0 == ~tmp_ndt_2~0; {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {4489#(= ~compRegistered~0 0)} ~returnVal2~0 := 0; {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {4489#(= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {4489#(= ~compRegistered~0 0)} #res := ~returnVal2~0; {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {4489#(= ~compRegistered~0 0)} assume true; {4489#(= ~compRegistered~0 0)} is VALID [2022-04-27 15:02:38,385 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4489#(= ~compRegistered~0 0)} {4475#(not (= ~compRegistered~0 0))} #470#return; {4464#false} is VALID [2022-04-27 15:02:38,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {4464#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {4464#false} is VALID [2022-04-27 15:02:38,385 INFO L290 TraceCheckUtils]: 37: Hoare triple {4464#false} assume 259 == ~__cil_tmp23~0; {4464#false} is VALID [2022-04-27 15:02:38,386 INFO L272 TraceCheckUtils]: 38: Hoare triple {4464#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {4464#false} is VALID [2022-04-27 15:02:38,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {4464#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {4464#false} is VALID [2022-04-27 15:02:38,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {4464#false} assume !(~s~0 == ~MPR3~0); {4464#false} is VALID [2022-04-27 15:02:38,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {4464#false} assume !(1 == ~customIrp~0); {4464#false} is VALID [2022-04-27 15:02:38,386 INFO L290 TraceCheckUtils]: 42: Hoare triple {4464#false} assume ~s~0 == ~MPR3~0; {4464#false} is VALID [2022-04-27 15:02:38,386 INFO L272 TraceCheckUtils]: 43: Hoare triple {4464#false} call errorFn(); {4464#false} is VALID [2022-04-27 15:02:38,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {4464#false} assume !false; {4464#false} is VALID [2022-04-27 15:02:38,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:38,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:38,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326055707] [2022-04-27 15:02:38,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326055707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:38,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:38,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 15:02:38,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680517064] [2022-04-27 15:02:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:38,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-04-27 15:02:38,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:38,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 15:02:38,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:38,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 15:02:38,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:38,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 15:02:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-27 15:02:38,414 INFO L87 Difference]: Start difference. First operand 217 states and 288 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 15:02:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:39,586 INFO L93 Difference]: Finished difference Result 274 states and 356 transitions. [2022-04-27 15:02:39,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 15:02:39,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-04-27 15:02:39,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 15:02:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 292 transitions. [2022-04-27 15:02:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 15:02:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 292 transitions. [2022-04-27 15:02:39,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 292 transitions. [2022-04-27 15:02:39,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:39,807 INFO L225 Difference]: With dead ends: 274 [2022-04-27 15:02:39,808 INFO L226 Difference]: Without dead ends: 208 [2022-04-27 15:02:39,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-04-27 15:02:39,808 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 379 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:39,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 448 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 15:02:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-27 15:02:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 190. [2022-04-27 15:02:39,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:39,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-27 15:02:39,816 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-27 15:02:39,817 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-27 15:02:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:39,820 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2022-04-27 15:02:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 271 transitions. [2022-04-27 15:02:39,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:39,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:39,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) Second operand 208 states. [2022-04-27 15:02:39,822 INFO L87 Difference]: Start difference. First operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) Second operand 208 states. [2022-04-27 15:02:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:39,825 INFO L93 Difference]: Finished difference Result 208 states and 271 transitions. [2022-04-27 15:02:39,825 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 271 transitions. [2022-04-27 15:02:39,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:39,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:39,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:39,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 156 states have internal predecessors, (208), 20 states have call successors, (20), 15 states have call predecessors, (20), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-27 15:02:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 250 transitions. [2022-04-27 15:02:39,829 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 250 transitions. Word has length 45 [2022-04-27 15:02:39,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:39,829 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 250 transitions. [2022-04-27 15:02:39,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 5 states have internal predecessors, (33), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 15:02:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-04-27 15:02:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 15:02:39,831 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:39,831 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:39,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:02:39,831 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:39,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:39,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1063639731, now seen corresponding path program 1 times [2022-04-27 15:02:39,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:39,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481155050] [2022-04-27 15:02:39,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:39,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:39,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:39,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {5563#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {5540#true} is VALID [2022-04-27 15:02:39,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {5540#true} assume true; {5540#true} is VALID [2022-04-27 15:02:39,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5540#true} {5540#true} #462#return; {5540#true} is VALID [2022-04-27 15:02:39,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:39,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {5564#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {5540#true} is VALID [2022-04-27 15:02:39,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {5540#true} assume true; {5540#true} is VALID [2022-04-27 15:02:39,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5540#true} {5540#true} #442#return; {5540#true} is VALID [2022-04-27 15:02:39,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:39,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {5565#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {5540#true} is VALID [2022-04-27 15:02:39,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {5540#true} assume true; {5540#true} is VALID [2022-04-27 15:02:39,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5540#true} {5540#true} #444#return; {5540#true} is VALID [2022-04-27 15:02:39,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 15:02:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:39,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 15:02:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:39,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {5566#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {5540#true} is VALID [2022-04-27 15:02:39,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {5540#true} assume true; {5540#true} is VALID [2022-04-27 15:02:39,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5540#true} {5540#true} #440#return; {5540#true} is VALID [2022-04-27 15:02:39,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {5566#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {5540#true} is VALID [2022-04-27 15:02:39,982 INFO L272 TraceCheckUtils]: 1: Hoare triple {5540#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {5566#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:39,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {5566#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {5540#true} is VALID [2022-04-27 15:02:39,982 INFO L290 TraceCheckUtils]: 3: Hoare triple {5540#true} assume true; {5540#true} is VALID [2022-04-27 15:02:39,982 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5540#true} {5540#true} #440#return; {5540#true} is VALID [2022-04-27 15:02:39,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {5540#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {5540#true} is VALID [2022-04-27 15:02:39,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {5540#true} assume true; {5540#true} is VALID [2022-04-27 15:02:39,999 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5540#true} {5540#true} #450#return; {5540#true} is VALID [2022-04-27 15:02:40,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-04-27 15:02:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:40,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {5570#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-27 15:02:40,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume true; {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-27 15:02:40,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} {5540#true} #452#return; {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-27 15:02:40,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {5540#true} call ULTIMATE.init(); {5563#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:40,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {5563#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {5540#true} is VALID [2022-04-27 15:02:40,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {5540#true} assume true; {5540#true} is VALID [2022-04-27 15:02:40,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5540#true} {5540#true} #462#return; {5540#true} is VALID [2022-04-27 15:02:40,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {5540#true} call #t~ret35 := main(); {5540#true} is VALID [2022-04-27 15:02:40,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {5540#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {5540#true} is VALID [2022-04-27 15:02:40,013 INFO L272 TraceCheckUtils]: 6: Hoare triple {5540#true} call _BLAST_init(); {5564#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:40,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {5564#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {5540#true} is VALID [2022-04-27 15:02:40,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {5540#true} assume true; {5540#true} is VALID [2022-04-27 15:02:40,013 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {5540#true} {5540#true} #442#return; {5540#true} is VALID [2022-04-27 15:02:40,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {5540#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {5540#true} is VALID [2022-04-27 15:02:40,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {5540#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {5540#true} is VALID [2022-04-27 15:02:40,014 INFO L272 TraceCheckUtils]: 12: Hoare triple {5540#true} call stub_driver_init(); {5565#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:40,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {5565#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {5540#true} is VALID [2022-04-27 15:02:40,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {5540#true} assume true; {5540#true} is VALID [2022-04-27 15:02:40,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5540#true} {5540#true} #444#return; {5540#true} is VALID [2022-04-27 15:02:40,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {5540#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {5540#true} is VALID [2022-04-27 15:02:40,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {5540#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {5540#true} is VALID [2022-04-27 15:02:40,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {5540#true} assume 3 == ~tmp_ndt_1~0; {5540#true} is VALID [2022-04-27 15:02:40,021 INFO L272 TraceCheckUtils]: 19: Hoare triple {5540#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {5540#true} is VALID [2022-04-27 15:02:40,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {5540#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {5540#true} is VALID [2022-04-27 15:02:40,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {5540#true} assume 0 == ~irpStack__MinorFunction~0; {5540#true} is VALID [2022-04-27 15:02:40,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {5540#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {5540#true} is VALID [2022-04-27 15:02:40,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {5540#true} assume !(~s~0 != ~NP~0); {5540#true} is VALID [2022-04-27 15:02:40,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {5540#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {5540#true} is VALID [2022-04-27 15:02:40,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {5540#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {5540#true} is VALID [2022-04-27 15:02:40,025 INFO L272 TraceCheckUtils]: 26: Hoare triple {5540#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {5540#true} is VALID [2022-04-27 15:02:40,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {5540#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {5540#true} is VALID [2022-04-27 15:02:40,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {5540#true} assume 0 != ~compRegistered~0; {5540#true} is VALID [2022-04-27 15:02:40,027 INFO L272 TraceCheckUtils]: 29: Hoare triple {5540#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {5566#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:40,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {5566#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {5540#true} is VALID [2022-04-27 15:02:40,027 INFO L272 TraceCheckUtils]: 31: Hoare triple {5540#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {5566#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:40,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {5566#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {5540#true} is VALID [2022-04-27 15:02:40,028 INFO L290 TraceCheckUtils]: 33: Hoare triple {5540#true} assume true; {5540#true} is VALID [2022-04-27 15:02:40,028 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5540#true} {5540#true} #440#return; {5540#true} is VALID [2022-04-27 15:02:40,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {5540#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {5540#true} is VALID [2022-04-27 15:02:40,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {5540#true} assume true; {5540#true} is VALID [2022-04-27 15:02:40,028 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5540#true} {5540#true} #450#return; {5540#true} is VALID [2022-04-27 15:02:40,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {5540#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {5540#true} is VALID [2022-04-27 15:02:40,029 INFO L272 TraceCheckUtils]: 39: Hoare triple {5540#true} call stubMoreProcessingRequired(); {5570#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:40,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {5570#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-27 15:02:40,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume true; {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-27 15:02:40,030 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} {5540#true} #452#return; {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-27 15:02:40,030 INFO L290 TraceCheckUtils]: 43: Hoare triple {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-27 15:02:40,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume 0 == ~tmp_ndt_2~0; {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-27 15:02:40,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} ~returnVal2~0 := 0; {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-27 15:02:40,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume !(~s~0 == ~NP~0); {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-27 15:02:40,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {5562#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume !(~s~0 == ~MPR1~0); {5541#false} is VALID [2022-04-27 15:02:40,032 INFO L290 TraceCheckUtils]: 48: Hoare triple {5541#false} assume !(~s~0 == ~SKIP1~0); {5541#false} is VALID [2022-04-27 15:02:40,032 INFO L272 TraceCheckUtils]: 49: Hoare triple {5541#false} call errorFn(); {5541#false} is VALID [2022-04-27 15:02:40,032 INFO L290 TraceCheckUtils]: 50: Hoare triple {5541#false} assume !false; {5541#false} is VALID [2022-04-27 15:02:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:40,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481155050] [2022-04-27 15:02:40,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481155050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:40,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:40,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 15:02:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891294775] [2022-04-27 15:02:40,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:40,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2022-04-27 15:02:40,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:40,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 15:02:40,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:40,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 15:02:40,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:40,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 15:02:40,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-27 15:02:40,065 INFO L87 Difference]: Start difference. First operand 190 states and 250 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 15:02:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:41,007 INFO L93 Difference]: Finished difference Result 258 states and 336 transitions. [2022-04-27 15:02:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 15:02:41,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2022-04-27 15:02:41,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 15:02:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 270 transitions. [2022-04-27 15:02:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 15:02:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 270 transitions. [2022-04-27 15:02:41,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 270 transitions. [2022-04-27 15:02:41,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:41,199 INFO L225 Difference]: With dead ends: 258 [2022-04-27 15:02:41,199 INFO L226 Difference]: Without dead ends: 197 [2022-04-27 15:02:41,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-04-27 15:02:41,201 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 113 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:41,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 340 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 15:02:41,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-27 15:02:41,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2022-04-27 15:02:41,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:41,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-27 15:02:41,216 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-27 15:02:41,216 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-27 15:02:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:41,220 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2022-04-27 15:02:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 257 transitions. [2022-04-27 15:02:41,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:41,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:41,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) Second operand 197 states. [2022-04-27 15:02:41,223 INFO L87 Difference]: Start difference. First operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) Second operand 197 states. [2022-04-27 15:02:41,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:41,227 INFO L93 Difference]: Finished difference Result 197 states and 257 transitions. [2022-04-27 15:02:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 257 transitions. [2022-04-27 15:02:41,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:41,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:41,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:41,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 154 states have internal predecessors, (205), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (22), 19 states have call predecessors, (22), 15 states have call successors, (22) [2022-04-27 15:02:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2022-04-27 15:02:41,233 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 51 [2022-04-27 15:02:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:41,233 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2022-04-27 15:02:41,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 15:02:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2022-04-27 15:02:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 15:02:41,234 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:41,234 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:41,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:02:41,234 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:41,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:41,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1356664997, now seen corresponding path program 1 times [2022-04-27 15:02:41,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:41,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443212432] [2022-04-27 15:02:41,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:41,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:41,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:41,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {6598#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {6566#true} is VALID [2022-04-27 15:02:41,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {6566#true} assume true; {6566#true} is VALID [2022-04-27 15:02:41,321 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6566#true} {6566#true} #462#return; {6566#true} is VALID [2022-04-27 15:02:41,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:41,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {6599#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {6574#(not (= ~SKIP1~0 ~NP~0))} assume true; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6574#(not (= ~SKIP1~0 ~NP~0))} {6566#true} #442#return; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:41,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {6600#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {6566#true} is VALID [2022-04-27 15:02:41,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {6566#true} assume true; {6566#true} is VALID [2022-04-27 15:02:41,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6566#true} {6574#(not (= ~SKIP1~0 ~NP~0))} #444#return; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-27 15:02:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:41,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:41,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {6613#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} assume 0 == ~tmp_ndt_2~0; {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,429 INFO L290 TraceCheckUtils]: 4: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} ~returnVal2~0 := 0; {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {6615#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {6615#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal2~0; {6615#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {6615#(= ~NP~0 |old(~s~0)|)} assume true; {6615#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,431 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {6615#(= ~NP~0 |old(~s~0)|)} {6602#(= ~SKIP1~0 ~s~0)} #478#return; {6612#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-27 15:02:41,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {6601#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {6566#true} is VALID [2022-04-27 15:02:41,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {6566#true} assume !(0 == ~irpStack__MinorFunction~0); {6566#true} is VALID [2022-04-27 15:02:41,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {6566#true} assume 23 == ~irpStack__MinorFunction~0; {6566#true} is VALID [2022-04-27 15:02:41,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {6566#true} ~devExt__SurpriseRemoved~0 := 1; {6566#true} is VALID [2022-04-27 15:02:41,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {6566#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {6602#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:41,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {6602#(= ~SKIP1~0 ~s~0)} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {6602#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:41,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {6602#(= ~SKIP1~0 ~s~0)} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {6613#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:41,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {6613#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} assume 0 == ~tmp_ndt_2~0; {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} ~returnVal2~0 := 0; {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {6615#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {6615#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal2~0; {6615#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {6615#(= ~NP~0 |old(~s~0)|)} assume true; {6615#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,435 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6615#(= ~NP~0 |old(~s~0)|)} {6602#(= ~SKIP1~0 ~s~0)} #478#return; {6612#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-27 15:02:41,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {6612#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~status~0 := #t~ret16;havoc #t~ret16; {6612#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-27 15:02:41,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {6612#(= ~SKIP1~0 ~NP~0)} #res := ~status~0; {6612#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-27 15:02:41,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {6612#(= ~SKIP1~0 ~NP~0)} assume true; {6612#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-27 15:02:41,437 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6612#(= ~SKIP1~0 ~NP~0)} {6574#(not (= ~SKIP1~0 ~NP~0))} #446#return; {6567#false} is VALID [2022-04-27 15:02:41,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {6566#true} call ULTIMATE.init(); {6598#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:41,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {6598#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {6566#true} is VALID [2022-04-27 15:02:41,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {6566#true} assume true; {6566#true} is VALID [2022-04-27 15:02:41,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6566#true} {6566#true} #462#return; {6566#true} is VALID [2022-04-27 15:02:41,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {6566#true} call #t~ret35 := main(); {6566#true} is VALID [2022-04-27 15:02:41,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {6566#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {6566#true} is VALID [2022-04-27 15:02:41,439 INFO L272 TraceCheckUtils]: 6: Hoare triple {6566#true} call _BLAST_init(); {6599#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:41,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {6599#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {6574#(not (= ~SKIP1~0 ~NP~0))} assume true; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,441 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6574#(not (= ~SKIP1~0 ~NP~0))} {6566#true} #442#return; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {6574#(not (= ~SKIP1~0 ~NP~0))} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {6574#(not (= ~SKIP1~0 ~NP~0))} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,446 INFO L272 TraceCheckUtils]: 12: Hoare triple {6574#(not (= ~SKIP1~0 ~NP~0))} call stub_driver_init(); {6600#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:41,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {6600#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {6566#true} is VALID [2022-04-27 15:02:41,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {6566#true} assume true; {6566#true} is VALID [2022-04-27 15:02:41,447 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6566#true} {6574#(not (= ~SKIP1~0 ~NP~0))} #444#return; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {6574#(not (= ~SKIP1~0 ~NP~0))} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {6574#(not (= ~SKIP1~0 ~NP~0))} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {6574#(not (= ~SKIP1~0 ~NP~0))} assume 3 == ~tmp_ndt_1~0; {6574#(not (= ~SKIP1~0 ~NP~0))} is VALID [2022-04-27 15:02:41,449 INFO L272 TraceCheckUtils]: 19: Hoare triple {6574#(not (= ~SKIP1~0 ~NP~0))} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {6601#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:41,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {6601#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {6566#true} is VALID [2022-04-27 15:02:41,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {6566#true} assume !(0 == ~irpStack__MinorFunction~0); {6566#true} is VALID [2022-04-27 15:02:41,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {6566#true} assume 23 == ~irpStack__MinorFunction~0; {6566#true} is VALID [2022-04-27 15:02:41,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {6566#true} ~devExt__SurpriseRemoved~0 := 1; {6566#true} is VALID [2022-04-27 15:02:41,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {6566#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {6602#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:41,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {6602#(= ~SKIP1~0 ~s~0)} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {6602#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-27 15:02:41,450 INFO L272 TraceCheckUtils]: 26: Hoare triple {6602#(= ~SKIP1~0 ~s~0)} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {6613#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:41,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {6613#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} assume !(0 != ~compRegistered~0); {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} assume 0 == ~tmp_ndt_2~0; {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} ~returnVal2~0 := 0; {6614#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {6614#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {6615#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {6615#(= ~NP~0 |old(~s~0)|)} #res := ~returnVal2~0; {6615#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {6615#(= ~NP~0 |old(~s~0)|)} assume true; {6615#(= ~NP~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:41,453 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6615#(= ~NP~0 |old(~s~0)|)} {6602#(= ~SKIP1~0 ~s~0)} #478#return; {6612#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-27 15:02:41,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {6612#(= ~SKIP1~0 ~NP~0)} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~status~0 := #t~ret16;havoc #t~ret16; {6612#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-27 15:02:41,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {6612#(= ~SKIP1~0 ~NP~0)} #res := ~status~0; {6612#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-27 15:02:41,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {6612#(= ~SKIP1~0 ~NP~0)} assume true; {6612#(= ~SKIP1~0 ~NP~0)} is VALID [2022-04-27 15:02:41,455 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6612#(= ~SKIP1~0 ~NP~0)} {6574#(not (= ~SKIP1~0 ~NP~0))} #446#return; {6567#false} is VALID [2022-04-27 15:02:41,455 INFO L290 TraceCheckUtils]: 40: Hoare triple {6567#false} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~status~1 := #t~ret27;havoc #t~ret27; {6567#false} is VALID [2022-04-27 15:02:41,455 INFO L290 TraceCheckUtils]: 41: Hoare triple {6567#false} assume !(1 == ~pended~0); {6567#false} is VALID [2022-04-27 15:02:41,455 INFO L290 TraceCheckUtils]: 42: Hoare triple {6567#false} assume !(1 == ~pended~0); {6567#false} is VALID [2022-04-27 15:02:41,455 INFO L290 TraceCheckUtils]: 43: Hoare triple {6567#false} assume ~s~0 != ~UNLOADED~0; {6567#false} is VALID [2022-04-27 15:02:41,455 INFO L290 TraceCheckUtils]: 44: Hoare triple {6567#false} assume -1 != ~status~1; {6567#false} is VALID [2022-04-27 15:02:41,455 INFO L290 TraceCheckUtils]: 45: Hoare triple {6567#false} assume !(~s~0 != ~SKIP2~0); {6567#false} is VALID [2022-04-27 15:02:41,455 INFO L290 TraceCheckUtils]: 46: Hoare triple {6567#false} assume 1 == ~pended~0; {6567#false} is VALID [2022-04-27 15:02:41,456 INFO L290 TraceCheckUtils]: 47: Hoare triple {6567#false} assume 259 != ~status~1; {6567#false} is VALID [2022-04-27 15:02:41,456 INFO L272 TraceCheckUtils]: 48: Hoare triple {6567#false} call errorFn(); {6567#false} is VALID [2022-04-27 15:02:41,456 INFO L290 TraceCheckUtils]: 49: Hoare triple {6567#false} assume !false; {6567#false} is VALID [2022-04-27 15:02:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:41,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:41,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443212432] [2022-04-27 15:02:41,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443212432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:41,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:41,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-27 15:02:41,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950232485] [2022-04-27 15:02:41,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:41,458 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-04-27 15:02:41,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:41,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 15:02:41,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:41,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 15:02:41,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:41,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 15:02:41,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-27 15:02:41,489 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 15:02:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:43,285 INFO L93 Difference]: Finished difference Result 234 states and 300 transitions. [2022-04-27 15:02:43,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 15:02:43,286 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-04-27 15:02:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 15:02:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 277 transitions. [2022-04-27 15:02:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 15:02:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 277 transitions. [2022-04-27 15:02:43,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 277 transitions. [2022-04-27 15:02:43,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:43,495 INFO L225 Difference]: With dead ends: 234 [2022-04-27 15:02:43,495 INFO L226 Difference]: Without dead ends: 210 [2022-04-27 15:02:43,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-04-27 15:02:43,499 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 417 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:43,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 478 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 15:02:43,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-27 15:02:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 188. [2022-04-27 15:02:43,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:43,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-04-27 15:02:43,511 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-04-27 15:02:43,511 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-04-27 15:02:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:43,518 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2022-04-27 15:02:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2022-04-27 15:02:43,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:43,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:43,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) Second operand 210 states. [2022-04-27 15:02:43,519 INFO L87 Difference]: Start difference. First operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) Second operand 210 states. [2022-04-27 15:02:43,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:43,523 INFO L93 Difference]: Finished difference Result 210 states and 270 transitions. [2022-04-27 15:02:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2022-04-27 15:02:43,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:43,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:43,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:43,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 152 states have (on average 1.3421052631578947) internal successors, (204), 154 states have internal predecessors, (204), 19 states have call successors, (19), 15 states have call predecessors, (19), 16 states have return successors, (21), 19 states have call predecessors, (21), 15 states have call successors, (21) [2022-04-27 15:02:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 244 transitions. [2022-04-27 15:02:43,526 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 244 transitions. Word has length 50 [2022-04-27 15:02:43,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:43,526 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 244 transitions. [2022-04-27 15:02:43,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 15:02:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 244 transitions. [2022-04-27 15:02:43,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 15:02:43,527 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:43,527 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:43,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:02:43,528 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:43,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:43,528 INFO L85 PathProgramCache]: Analyzing trace with hash -957846954, now seen corresponding path program 1 times [2022-04-27 15:02:43,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:43,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972305041] [2022-04-27 15:02:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:43,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:43,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:43,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {7653#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {7617#true} is VALID [2022-04-27 15:02:43,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {7617#true} assume true; {7617#true} is VALID [2022-04-27 15:02:43,617 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7617#true} {7617#true} #462#return; {7617#true} is VALID [2022-04-27 15:02:43,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:43,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {7654#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7617#true} is VALID [2022-04-27 15:02:43,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {7617#true} assume true; {7617#true} is VALID [2022-04-27 15:02:43,639 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7617#true} {7617#true} #442#return; {7617#true} is VALID [2022-04-27 15:02:43,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:43,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {7655#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7628#(= ~pended~0 0)} is VALID [2022-04-27 15:02:43,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {7628#(= ~pended~0 0)} assume true; {7628#(= ~pended~0 0)} is VALID [2022-04-27 15:02:43,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7628#(= ~pended~0 0)} {7617#true} #444#return; {7628#(= ~pended~0 0)} is VALID [2022-04-27 15:02:43,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-27 15:02:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:43,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:43,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:43,685 INFO L290 TraceCheckUtils]: 0: Hoare triple {7668#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {7617#true} is VALID [2022-04-27 15:02:43,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {7617#true} assume !(0 != ~compRegistered~0); {7617#true} is VALID [2022-04-27 15:02:43,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {7617#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {7617#true} is VALID [2022-04-27 15:02:43,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {7617#true} assume 0 == ~tmp_ndt_2~0; {7617#true} is VALID [2022-04-27 15:02:43,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {7617#true} ~returnVal2~0 := 0; {7617#true} is VALID [2022-04-27 15:02:43,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {7617#true} assume !(~s~0 == ~NP~0); {7617#true} is VALID [2022-04-27 15:02:43,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {7617#true} assume !(~s~0 == ~MPR1~0); {7617#true} is VALID [2022-04-27 15:02:43,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {7617#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal2~0; {7617#true} is VALID [2022-04-27 15:02:43,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {7617#true} #res := ~returnVal2~0; {7617#true} is VALID [2022-04-27 15:02:43,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {7617#true} assume true; {7617#true} is VALID [2022-04-27 15:02:43,686 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7617#true} {7617#true} #478#return; {7617#true} is VALID [2022-04-27 15:02:43,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {7656#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {7617#true} is VALID [2022-04-27 15:02:43,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {7617#true} assume !(0 == ~irpStack__MinorFunction~0); {7617#true} is VALID [2022-04-27 15:02:43,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {7617#true} assume 23 == ~irpStack__MinorFunction~0; {7617#true} is VALID [2022-04-27 15:02:43,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {7617#true} ~devExt__SurpriseRemoved~0 := 1; {7617#true} is VALID [2022-04-27 15:02:43,686 INFO L290 TraceCheckUtils]: 4: Hoare triple {7617#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {7617#true} is VALID [2022-04-27 15:02:43,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {7617#true} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {7617#true} is VALID [2022-04-27 15:02:43,687 INFO L272 TraceCheckUtils]: 6: Hoare triple {7617#true} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {7668#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:43,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {7668#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {7617#true} is VALID [2022-04-27 15:02:43,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {7617#true} assume !(0 != ~compRegistered~0); {7617#true} is VALID [2022-04-27 15:02:43,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {7617#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {7617#true} is VALID [2022-04-27 15:02:43,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {7617#true} assume 0 == ~tmp_ndt_2~0; {7617#true} is VALID [2022-04-27 15:02:43,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {7617#true} ~returnVal2~0 := 0; {7617#true} is VALID [2022-04-27 15:02:43,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {7617#true} assume !(~s~0 == ~NP~0); {7617#true} is VALID [2022-04-27 15:02:43,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {7617#true} assume !(~s~0 == ~MPR1~0); {7617#true} is VALID [2022-04-27 15:02:43,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {7617#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal2~0; {7617#true} is VALID [2022-04-27 15:02:43,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {7617#true} #res := ~returnVal2~0; {7617#true} is VALID [2022-04-27 15:02:43,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {7617#true} assume true; {7617#true} is VALID [2022-04-27 15:02:43,688 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {7617#true} {7617#true} #478#return; {7617#true} is VALID [2022-04-27 15:02:43,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {7617#true} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~status~0 := #t~ret16;havoc #t~ret16; {7617#true} is VALID [2022-04-27 15:02:43,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {7617#true} #res := ~status~0; {7617#true} is VALID [2022-04-27 15:02:43,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {7617#true} assume true; {7617#true} is VALID [2022-04-27 15:02:43,689 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7617#true} {7630#(not (= ~pended~0 1))} #446#return; {7630#(not (= ~pended~0 1))} is VALID [2022-04-27 15:02:43,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {7617#true} call ULTIMATE.init(); {7653#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:43,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {7653#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {7617#true} is VALID [2022-04-27 15:02:43,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {7617#true} assume true; {7617#true} is VALID [2022-04-27 15:02:43,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7617#true} {7617#true} #462#return; {7617#true} is VALID [2022-04-27 15:02:43,690 INFO L272 TraceCheckUtils]: 4: Hoare triple {7617#true} call #t~ret35 := main(); {7617#true} is VALID [2022-04-27 15:02:43,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {7617#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {7617#true} is VALID [2022-04-27 15:02:43,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {7617#true} call _BLAST_init(); {7654#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:43,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {7654#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7617#true} is VALID [2022-04-27 15:02:43,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {7617#true} assume true; {7617#true} is VALID [2022-04-27 15:02:43,691 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {7617#true} {7617#true} #442#return; {7617#true} is VALID [2022-04-27 15:02:43,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {7617#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {7617#true} is VALID [2022-04-27 15:02:43,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {7617#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {7617#true} is VALID [2022-04-27 15:02:43,692 INFO L272 TraceCheckUtils]: 12: Hoare triple {7617#true} call stub_driver_init(); {7655#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:43,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {7655#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {7628#(= ~pended~0 0)} is VALID [2022-04-27 15:02:43,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {7628#(= ~pended~0 0)} assume true; {7628#(= ~pended~0 0)} is VALID [2022-04-27 15:02:43,692 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7628#(= ~pended~0 0)} {7617#true} #444#return; {7628#(= ~pended~0 0)} is VALID [2022-04-27 15:02:43,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {7628#(= ~pended~0 0)} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {7629#(and (= main_~__cil_tmp8~0 1) (= ~pended~0 0))} is VALID [2022-04-27 15:02:43,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {7629#(and (= main_~__cil_tmp8~0 1) (= ~pended~0 0))} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {7630#(not (= ~pended~0 1))} is VALID [2022-04-27 15:02:43,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {7630#(not (= ~pended~0 1))} assume 3 == ~tmp_ndt_1~0; {7630#(not (= ~pended~0 1))} is VALID [2022-04-27 15:02:43,694 INFO L272 TraceCheckUtils]: 19: Hoare triple {7630#(not (= ~pended~0 1))} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {7656#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:43,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {7656#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {7617#true} is VALID [2022-04-27 15:02:43,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {7617#true} assume !(0 == ~irpStack__MinorFunction~0); {7617#true} is VALID [2022-04-27 15:02:43,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {7617#true} assume 23 == ~irpStack__MinorFunction~0; {7617#true} is VALID [2022-04-27 15:02:43,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {7617#true} ~devExt__SurpriseRemoved~0 := 1; {7617#true} is VALID [2022-04-27 15:02:43,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {7617#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {7617#true} is VALID [2022-04-27 15:02:43,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {7617#true} #t~post14 := ~Irp__CurrentLocation~0;~Irp__CurrentLocation~0 := 1 + #t~post14;havoc #t~post14;#t~post15 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~Irp__Tail__Overlay__CurrentStackLocation~0 := 1 + #t~post15;havoc #t~post15; {7617#true} is VALID [2022-04-27 15:02:43,706 INFO L272 TraceCheckUtils]: 26: Hoare triple {7617#true} call #t~ret16 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {7668#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:43,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {7668#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {7617#true} is VALID [2022-04-27 15:02:43,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {7617#true} assume !(0 != ~compRegistered~0); {7617#true} is VALID [2022-04-27 15:02:43,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {7617#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {7617#true} is VALID [2022-04-27 15:02:43,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {7617#true} assume 0 == ~tmp_ndt_2~0; {7617#true} is VALID [2022-04-27 15:02:43,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {7617#true} ~returnVal2~0 := 0; {7617#true} is VALID [2022-04-27 15:02:43,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {7617#true} assume !(~s~0 == ~NP~0); {7617#true} is VALID [2022-04-27 15:02:43,706 INFO L290 TraceCheckUtils]: 33: Hoare triple {7617#true} assume !(~s~0 == ~MPR1~0); {7617#true} is VALID [2022-04-27 15:02:43,706 INFO L290 TraceCheckUtils]: 34: Hoare triple {7617#true} assume ~s~0 == ~SKIP1~0;~s~0 := ~SKIP2~0;~lowerDriverReturn~0 := ~returnVal2~0; {7617#true} is VALID [2022-04-27 15:02:43,706 INFO L290 TraceCheckUtils]: 35: Hoare triple {7617#true} #res := ~returnVal2~0; {7617#true} is VALID [2022-04-27 15:02:43,706 INFO L290 TraceCheckUtils]: 36: Hoare triple {7617#true} assume true; {7617#true} is VALID [2022-04-27 15:02:43,706 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {7617#true} {7617#true} #478#return; {7617#true} is VALID [2022-04-27 15:02:43,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {7617#true} assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;~status~0 := #t~ret16;havoc #t~ret16; {7617#true} is VALID [2022-04-27 15:02:43,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {7617#true} #res := ~status~0; {7617#true} is VALID [2022-04-27 15:02:43,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {7617#true} assume true; {7617#true} is VALID [2022-04-27 15:02:43,707 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7617#true} {7630#(not (= ~pended~0 1))} #446#return; {7630#(not (= ~pended~0 1))} is VALID [2022-04-27 15:02:43,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {7630#(not (= ~pended~0 1))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;~status~1 := #t~ret27;havoc #t~ret27; {7630#(not (= ~pended~0 1))} is VALID [2022-04-27 15:02:43,708 INFO L290 TraceCheckUtils]: 43: Hoare triple {7630#(not (= ~pended~0 1))} assume !(1 == ~pended~0); {7630#(not (= ~pended~0 1))} is VALID [2022-04-27 15:02:43,708 INFO L290 TraceCheckUtils]: 44: Hoare triple {7630#(not (= ~pended~0 1))} assume !(1 == ~pended~0); {7630#(not (= ~pended~0 1))} is VALID [2022-04-27 15:02:43,708 INFO L290 TraceCheckUtils]: 45: Hoare triple {7630#(not (= ~pended~0 1))} assume ~s~0 != ~UNLOADED~0; {7630#(not (= ~pended~0 1))} is VALID [2022-04-27 15:02:43,708 INFO L290 TraceCheckUtils]: 46: Hoare triple {7630#(not (= ~pended~0 1))} assume -1 != ~status~1; {7630#(not (= ~pended~0 1))} is VALID [2022-04-27 15:02:43,709 INFO L290 TraceCheckUtils]: 47: Hoare triple {7630#(not (= ~pended~0 1))} assume !(~s~0 != ~SKIP2~0); {7630#(not (= ~pended~0 1))} is VALID [2022-04-27 15:02:43,709 INFO L290 TraceCheckUtils]: 48: Hoare triple {7630#(not (= ~pended~0 1))} assume 1 == ~pended~0; {7618#false} is VALID [2022-04-27 15:02:43,709 INFO L290 TraceCheckUtils]: 49: Hoare triple {7618#false} assume 259 != ~status~1; {7618#false} is VALID [2022-04-27 15:02:43,709 INFO L272 TraceCheckUtils]: 50: Hoare triple {7618#false} call errorFn(); {7618#false} is VALID [2022-04-27 15:02:43,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {7618#false} assume !false; {7618#false} is VALID [2022-04-27 15:02:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:43,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:43,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972305041] [2022-04-27 15:02:43,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972305041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:43,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:43,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-27 15:02:43,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004753720] [2022-04-27 15:02:43,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:43,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-04-27 15:02:43,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:43,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 15:02:43,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:43,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 15:02:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:43,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 15:02:43,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 15:02:43,741 INFO L87 Difference]: Start difference. First operand 188 states and 244 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 15:02:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:44,467 INFO L93 Difference]: Finished difference Result 203 states and 262 transitions. [2022-04-27 15:02:44,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 15:02:44,467 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-04-27 15:02:44,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:44,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 15:02:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-04-27 15:02:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 15:02:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2022-04-27 15:02:44,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 206 transitions. [2022-04-27 15:02:44,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:44,639 INFO L225 Difference]: With dead ends: 203 [2022-04-27 15:02:44,639 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 15:02:44,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-04-27 15:02:44,640 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 326 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:44,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 258 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 15:02:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 15:02:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-27 15:02:44,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:44,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:44,647 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:44,648 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:44,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:44,649 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-04-27 15:02:44,649 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-27 15:02:44,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:44,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:44,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-27 15:02:44,654 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-27 15:02:44,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:44,655 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2022-04-27 15:02:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-27 15:02:44,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:44,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:44,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:44,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:44,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1791044776119404) internal successors, (79), 68 states have internal predecessors, (79), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:44,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-04-27 15:02:44,657 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 52 [2022-04-27 15:02:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:44,657 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-04-27 15:02:44,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 15:02:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-04-27 15:02:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 15:02:44,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:44,658 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:44,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:02:44,658 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:44,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:44,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1066997237, now seen corresponding path program 1 times [2022-04-27 15:02:44,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:44,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796436879] [2022-04-27 15:02:44,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:44,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:44,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:44,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {8290#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {8255#true} is VALID [2022-04-27 15:02:44,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-27 15:02:44,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8255#true} {8255#true} #462#return; {8255#true} is VALID [2022-04-27 15:02:44,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:44,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {8291#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume true; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} {8255#true} #442#return; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:44,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {8292#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {8255#true} is VALID [2022-04-27 15:02:44,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-27 15:02:44,776 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8255#true} {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #444#return; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 15:02:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:44,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 15:02:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 15:02:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:44,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {8307#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {8255#true} is VALID [2022-04-27 15:02:44,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-27 15:02:44,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8255#true} {8255#true} #440#return; {8255#true} is VALID [2022-04-27 15:02:44,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {8307#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {8255#true} is VALID [2022-04-27 15:02:44,839 INFO L272 TraceCheckUtils]: 1: Hoare triple {8255#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {8307#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:44,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {8307#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {8255#true} is VALID [2022-04-27 15:02:44,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-27 15:02:44,840 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8255#true} {8255#true} #440#return; {8255#true} is VALID [2022-04-27 15:02:44,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {8255#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {8255#true} is VALID [2022-04-27 15:02:44,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-27 15:02:44,840 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8255#true} {8255#true} #450#return; {8255#true} is VALID [2022-04-27 15:02:44,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:44,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {8311#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {8312#(= ~MPR1~0 ~s~0)} is VALID [2022-04-27 15:02:44,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {8312#(= ~MPR1~0 ~s~0)} assume true; {8312#(= ~MPR1~0 ~s~0)} is VALID [2022-04-27 15:02:44,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8312#(= ~MPR1~0 ~s~0)} {8255#true} #452#return; {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-27 15:02:44,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {8293#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {8255#true} is VALID [2022-04-27 15:02:44,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {8255#true} assume 0 != ~compRegistered~0; {8255#true} is VALID [2022-04-27 15:02:44,855 INFO L272 TraceCheckUtils]: 2: Hoare triple {8255#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {8307#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:44,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {8307#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {8255#true} is VALID [2022-04-27 15:02:44,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {8255#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {8307#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:44,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {8307#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {8255#true} is VALID [2022-04-27 15:02:44,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-27 15:02:44,856 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8255#true} {8255#true} #440#return; {8255#true} is VALID [2022-04-27 15:02:44,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {8255#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {8255#true} is VALID [2022-04-27 15:02:44,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-27 15:02:44,856 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8255#true} {8255#true} #450#return; {8255#true} is VALID [2022-04-27 15:02:44,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {8255#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {8255#true} is VALID [2022-04-27 15:02:44,857 INFO L272 TraceCheckUtils]: 12: Hoare triple {8255#true} call stubMoreProcessingRequired(); {8311#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:44,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {8311#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {8312#(= ~MPR1~0 ~s~0)} is VALID [2022-04-27 15:02:44,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {8312#(= ~MPR1~0 ~s~0)} assume true; {8312#(= ~MPR1~0 ~s~0)} is VALID [2022-04-27 15:02:44,857 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8312#(= ~MPR1~0 ~s~0)} {8255#true} #452#return; {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-27 15:02:44,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-27 15:02:44,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume 0 == ~tmp_ndt_2~0; {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-27 15:02:44,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} ~returnVal2~0 := 0; {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-27 15:02:44,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {8306#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-27 15:02:44,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {8306#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} #res := ~returnVal2~0; {8306#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-27 15:02:44,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {8306#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} assume true; {8306#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-27 15:02:44,860 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8306#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #470#return; {8256#false} is VALID [2022-04-27 15:02:44,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {8255#true} call ULTIMATE.init(); {8290#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:44,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {8290#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {8255#true} is VALID [2022-04-27 15:02:44,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-27 15:02:44,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8255#true} {8255#true} #462#return; {8255#true} is VALID [2022-04-27 15:02:44,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {8255#true} call #t~ret35 := main(); {8255#true} is VALID [2022-04-27 15:02:44,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {8255#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {8255#true} is VALID [2022-04-27 15:02:44,862 INFO L272 TraceCheckUtils]: 6: Hoare triple {8255#true} call _BLAST_init(); {8291#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:44,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {8291#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume true; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,864 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} {8255#true} #442#return; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,865 INFO L272 TraceCheckUtils]: 12: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call stub_driver_init(); {8292#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:44,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {8292#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {8255#true} is VALID [2022-04-27 15:02:44,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-27 15:02:44,866 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8255#true} {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #444#return; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 3 == ~tmp_ndt_1~0; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,867 INFO L272 TraceCheckUtils]: 19: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 0 == ~irpStack__MinorFunction~0; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(~s~0 != ~NP~0); {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-27 15:02:44,870 INFO L272 TraceCheckUtils]: 26: Hoare triple {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {8293#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:44,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {8293#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {8255#true} is VALID [2022-04-27 15:02:44,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {8255#true} assume 0 != ~compRegistered~0; {8255#true} is VALID [2022-04-27 15:02:44,871 INFO L272 TraceCheckUtils]: 29: Hoare triple {8255#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {8307#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:44,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {8307#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {8255#true} is VALID [2022-04-27 15:02:44,871 INFO L272 TraceCheckUtils]: 31: Hoare triple {8255#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {8307#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:44,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {8307#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {8255#true} is VALID [2022-04-27 15:02:44,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-27 15:02:44,871 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8255#true} {8255#true} #440#return; {8255#true} is VALID [2022-04-27 15:02:44,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {8255#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {8255#true} is VALID [2022-04-27 15:02:44,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {8255#true} assume true; {8255#true} is VALID [2022-04-27 15:02:44,872 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8255#true} {8255#true} #450#return; {8255#true} is VALID [2022-04-27 15:02:44,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {8255#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {8255#true} is VALID [2022-04-27 15:02:44,872 INFO L272 TraceCheckUtils]: 39: Hoare triple {8255#true} call stubMoreProcessingRequired(); {8311#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:44,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {8311#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {8312#(= ~MPR1~0 ~s~0)} is VALID [2022-04-27 15:02:44,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {8312#(= ~MPR1~0 ~s~0)} assume true; {8312#(= ~MPR1~0 ~s~0)} is VALID [2022-04-27 15:02:44,873 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8312#(= ~MPR1~0 ~s~0)} {8255#true} #452#return; {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-27 15:02:44,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-27 15:02:44,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume 0 == ~tmp_ndt_2~0; {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-27 15:02:44,874 INFO L290 TraceCheckUtils]: 45: Hoare triple {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} ~returnVal2~0 := 0; {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-27 15:02:44,874 INFO L290 TraceCheckUtils]: 46: Hoare triple {8305#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {8306#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-27 15:02:44,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {8306#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} #res := ~returnVal2~0; {8306#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-27 15:02:44,875 INFO L290 TraceCheckUtils]: 48: Hoare triple {8306#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} assume true; {8306#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-27 15:02:44,875 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {8306#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} {8263#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #470#return; {8256#false} is VALID [2022-04-27 15:02:44,875 INFO L290 TraceCheckUtils]: 50: Hoare triple {8256#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {8256#false} is VALID [2022-04-27 15:02:44,875 INFO L290 TraceCheckUtils]: 51: Hoare triple {8256#false} assume 259 == ~__cil_tmp23~0; {8256#false} is VALID [2022-04-27 15:02:44,875 INFO L272 TraceCheckUtils]: 52: Hoare triple {8256#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {8256#false} is VALID [2022-04-27 15:02:44,875 INFO L290 TraceCheckUtils]: 53: Hoare triple {8256#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {8256#false} is VALID [2022-04-27 15:02:44,875 INFO L290 TraceCheckUtils]: 54: Hoare triple {8256#false} assume !(~s~0 == ~MPR3~0); {8256#false} is VALID [2022-04-27 15:02:44,876 INFO L290 TraceCheckUtils]: 55: Hoare triple {8256#false} assume !(1 == ~customIrp~0); {8256#false} is VALID [2022-04-27 15:02:44,876 INFO L290 TraceCheckUtils]: 56: Hoare triple {8256#false} assume ~s~0 == ~MPR3~0; {8256#false} is VALID [2022-04-27 15:02:44,876 INFO L272 TraceCheckUtils]: 57: Hoare triple {8256#false} call errorFn(); {8256#false} is VALID [2022-04-27 15:02:44,876 INFO L290 TraceCheckUtils]: 58: Hoare triple {8256#false} assume !false; {8256#false} is VALID [2022-04-27 15:02:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:44,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:44,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796436879] [2022-04-27 15:02:44,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796436879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:44,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:44,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-27 15:02:44,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96428156] [2022-04-27 15:02:44,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:44,877 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-04-27 15:02:44,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:44,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:44,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:44,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 15:02:44,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:44,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 15:02:44,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 15:02:44,916 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:45,670 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2022-04-27 15:02:45,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 15:02:45,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2022-04-27 15:02:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2022-04-27 15:02:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 123 transitions. [2022-04-27 15:02:45,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 123 transitions. [2022-04-27 15:02:45,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:45,791 INFO L225 Difference]: With dead ends: 119 [2022-04-27 15:02:45,791 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 15:02:45,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-04-27 15:02:45,794 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 150 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:45,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 222 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 15:02:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 15:02:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-27 15:02:45,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:45,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:45,811 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:45,811 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:45,812 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-04-27 15:02:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-27 15:02:45,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:45,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:45,813 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-27 15:02:45,813 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-27 15:02:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:45,814 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2022-04-27 15:02:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-27 15:02:45,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:45,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:45,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:45,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-04-27 15:02:45,815 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 59 [2022-04-27 15:02:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:45,816 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-04-27 15:02:45,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-04-27 15:02:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 15:02:45,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:45,816 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:45,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:02:45,817 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:45,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash 438062746, now seen corresponding path program 1 times [2022-04-27 15:02:45,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:45,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313021449] [2022-04-27 15:02:45,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:45,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:45,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {8841#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {8805#true} is VALID [2022-04-27 15:02:45,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8805#true} {8805#true} #462#return; {8805#true} is VALID [2022-04-27 15:02:45,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:45,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {8842#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {8805#true} is VALID [2022-04-27 15:02:45,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,924 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8805#true} {8805#true} #442#return; {8805#true} is VALID [2022-04-27 15:02:45,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:45,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {8843#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {8805#true} is VALID [2022-04-27 15:02:45,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,935 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8805#true} {8805#true} #444#return; {8805#true} is VALID [2022-04-27 15:02:45,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 15:02:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:45,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 15:02:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:45,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 15:02:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:45,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {8857#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {8805#true} is VALID [2022-04-27 15:02:45,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8805#true} {8805#true} #440#return; {8805#true} is VALID [2022-04-27 15:02:45,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {8857#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {8805#true} is VALID [2022-04-27 15:02:45,967 INFO L272 TraceCheckUtils]: 1: Hoare triple {8805#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {8857#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:45,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {8857#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {8805#true} is VALID [2022-04-27 15:02:45,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,967 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8805#true} {8805#true} #440#return; {8805#true} is VALID [2022-04-27 15:02:45,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {8805#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {8805#true} is VALID [2022-04-27 15:02:45,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,967 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8805#true} {8805#true} #450#return; {8805#true} is VALID [2022-04-27 15:02:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:45,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {8861#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {8805#true} is VALID [2022-04-27 15:02:45,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,974 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8805#true} {8805#true} #452#return; {8805#true} is VALID [2022-04-27 15:02:45,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {8844#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {8805#true} is VALID [2022-04-27 15:02:45,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {8805#true} assume 0 != ~compRegistered~0; {8805#true} is VALID [2022-04-27 15:02:45,975 INFO L272 TraceCheckUtils]: 2: Hoare triple {8805#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {8857#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:45,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {8857#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {8805#true} is VALID [2022-04-27 15:02:45,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {8805#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {8857#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:45,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {8857#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {8805#true} is VALID [2022-04-27 15:02:45,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,976 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8805#true} {8805#true} #440#return; {8805#true} is VALID [2022-04-27 15:02:45,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {8805#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {8805#true} is VALID [2022-04-27 15:02:45,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,976 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8805#true} {8805#true} #450#return; {8805#true} is VALID [2022-04-27 15:02:45,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {8805#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {8805#true} is VALID [2022-04-27 15:02:45,976 INFO L272 TraceCheckUtils]: 12: Hoare triple {8805#true} call stubMoreProcessingRequired(); {8861#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:45,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {8861#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {8805#true} is VALID [2022-04-27 15:02:45,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,976 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8805#true} {8805#true} #452#return; {8805#true} is VALID [2022-04-27 15:02:45,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {8805#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {8805#true} is VALID [2022-04-27 15:02:45,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {8805#true} assume 0 == ~tmp_ndt_2~0; {8805#true} is VALID [2022-04-27 15:02:45,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {8805#true} ~returnVal2~0 := 0; {8856#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:45,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {8856#(<= IofCallDriver_~returnVal2~0 0)} assume !(~s~0 == ~NP~0); {8856#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:45,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {8856#(<= IofCallDriver_~returnVal2~0 0)} assume ~s~0 == ~MPR1~0; {8856#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:45,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {8856#(<= IofCallDriver_~returnVal2~0 0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {8806#false} is VALID [2022-04-27 15:02:45,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {8806#false} #res := ~returnVal2~0; {8806#false} is VALID [2022-04-27 15:02:45,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {8806#false} assume true; {8806#false} is VALID [2022-04-27 15:02:45,978 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8806#false} {8805#true} #470#return; {8806#false} is VALID [2022-04-27 15:02:45,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {8805#true} call ULTIMATE.init(); {8841#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:45,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {8841#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {8805#true} is VALID [2022-04-27 15:02:45,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8805#true} {8805#true} #462#return; {8805#true} is VALID [2022-04-27 15:02:45,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {8805#true} call #t~ret35 := main(); {8805#true} is VALID [2022-04-27 15:02:45,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {8805#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {8805#true} is VALID [2022-04-27 15:02:45,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {8805#true} call _BLAST_init(); {8842#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:45,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {8842#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {8805#true} is VALID [2022-04-27 15:02:45,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,981 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8805#true} {8805#true} #442#return; {8805#true} is VALID [2022-04-27 15:02:45,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {8805#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {8805#true} is VALID [2022-04-27 15:02:45,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {8805#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {8805#true} is VALID [2022-04-27 15:02:45,982 INFO L272 TraceCheckUtils]: 12: Hoare triple {8805#true} call stub_driver_init(); {8843#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:45,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {8843#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {8805#true} is VALID [2022-04-27 15:02:45,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,982 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8805#true} {8805#true} #444#return; {8805#true} is VALID [2022-04-27 15:02:45,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {8805#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {8805#true} is VALID [2022-04-27 15:02:45,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {8805#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {8805#true} is VALID [2022-04-27 15:02:45,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {8805#true} assume 3 == ~tmp_ndt_1~0; {8805#true} is VALID [2022-04-27 15:02:45,983 INFO L272 TraceCheckUtils]: 19: Hoare triple {8805#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {8805#true} is VALID [2022-04-27 15:02:45,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {8805#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {8805#true} is VALID [2022-04-27 15:02:45,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {8805#true} assume 0 == ~irpStack__MinorFunction~0; {8805#true} is VALID [2022-04-27 15:02:45,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {8805#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {8805#true} is VALID [2022-04-27 15:02:45,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {8805#true} assume !(~s~0 != ~NP~0); {8805#true} is VALID [2022-04-27 15:02:45,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {8805#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {8805#true} is VALID [2022-04-27 15:02:45,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {8805#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {8805#true} is VALID [2022-04-27 15:02:45,984 INFO L272 TraceCheckUtils]: 26: Hoare triple {8805#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {8844#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:45,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {8844#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {8805#true} is VALID [2022-04-27 15:02:45,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {8805#true} assume 0 != ~compRegistered~0; {8805#true} is VALID [2022-04-27 15:02:45,985 INFO L272 TraceCheckUtils]: 29: Hoare triple {8805#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {8857#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:45,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {8857#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {8805#true} is VALID [2022-04-27 15:02:45,985 INFO L272 TraceCheckUtils]: 31: Hoare triple {8805#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {8857#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:45,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {8857#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {8805#true} is VALID [2022-04-27 15:02:45,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,985 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8805#true} {8805#true} #440#return; {8805#true} is VALID [2022-04-27 15:02:45,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {8805#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {8805#true} is VALID [2022-04-27 15:02:45,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,986 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {8805#true} {8805#true} #450#return; {8805#true} is VALID [2022-04-27 15:02:45,986 INFO L290 TraceCheckUtils]: 38: Hoare triple {8805#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {8805#true} is VALID [2022-04-27 15:02:45,986 INFO L272 TraceCheckUtils]: 39: Hoare triple {8805#true} call stubMoreProcessingRequired(); {8861#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:45,986 INFO L290 TraceCheckUtils]: 40: Hoare triple {8861#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {8805#true} is VALID [2022-04-27 15:02:45,986 INFO L290 TraceCheckUtils]: 41: Hoare triple {8805#true} assume true; {8805#true} is VALID [2022-04-27 15:02:45,986 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8805#true} {8805#true} #452#return; {8805#true} is VALID [2022-04-27 15:02:45,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {8805#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {8805#true} is VALID [2022-04-27 15:02:45,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {8805#true} assume 0 == ~tmp_ndt_2~0; {8805#true} is VALID [2022-04-27 15:02:45,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {8805#true} ~returnVal2~0 := 0; {8856#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:45,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {8856#(<= IofCallDriver_~returnVal2~0 0)} assume !(~s~0 == ~NP~0); {8856#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:45,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {8856#(<= IofCallDriver_~returnVal2~0 0)} assume ~s~0 == ~MPR1~0; {8856#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:45,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {8856#(<= IofCallDriver_~returnVal2~0 0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {8806#false} #res := ~returnVal2~0; {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {8806#false} assume true; {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {8806#false} {8805#true} #470#return; {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {8806#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L290 TraceCheckUtils]: 53: Hoare triple {8806#false} assume 259 == ~__cil_tmp23~0; {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L272 TraceCheckUtils]: 54: Hoare triple {8806#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {8806#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {8806#false} assume !(~s~0 == ~MPR3~0); {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {8806#false} assume !(1 == ~customIrp~0); {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {8806#false} assume ~s~0 == ~MPR3~0; {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L272 TraceCheckUtils]: 59: Hoare triple {8806#false} call errorFn(); {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L290 TraceCheckUtils]: 60: Hoare triple {8806#false} assume !false; {8806#false} is VALID [2022-04-27 15:02:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:45,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:45,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313021449] [2022-04-27 15:02:45,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313021449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:45,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:45,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 15:02:45,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207022154] [2022-04-27 15:02:45,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:45,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-04-27 15:02:45,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:45,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:46,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:46,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 15:02:46,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:46,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 15:02:46,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-27 15:02:46,033 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:46,439 INFO L93 Difference]: Finished difference Result 125 states and 141 transitions. [2022-04-27 15:02:46,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 15:02:46,439 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-04-27 15:02:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-04-27 15:02:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-04-27 15:02:46,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2022-04-27 15:02:46,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:46,554 INFO L225 Difference]: With dead ends: 125 [2022-04-27 15:02:46,554 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 15:02:46,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-27 15:02:46,554 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 81 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:46,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 188 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:02:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 15:02:46,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-04-27 15:02:46,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:46,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:46,580 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:46,580 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:46,581 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-04-27 15:02:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-04-27 15:02:46,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:46,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:46,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 97 states. [2022-04-27 15:02:46,582 INFO L87 Difference]: Start difference. First operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 97 states. [2022-04-27 15:02:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:46,583 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-04-27 15:02:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-04-27 15:02:46,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:46,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:46,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:46,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 71 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2022-04-27 15:02:46,585 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 61 [2022-04-27 15:02:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:46,585 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2022-04-27 15:02:46,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2022-04-27 15:02:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 15:02:46,586 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:46,586 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:46,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:02:46,586 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:46,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:46,587 INFO L85 PathProgramCache]: Analyzing trace with hash -148743268, now seen corresponding path program 1 times [2022-04-27 15:02:46,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:46,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162612676] [2022-04-27 15:02:46,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:46,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:46,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:46,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {9399#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {9361#true} is VALID [2022-04-27 15:02:46,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,666 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9361#true} {9361#true} #462#return; {9361#true} is VALID [2022-04-27 15:02:46,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:46,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {9400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {9361#true} is VALID [2022-04-27 15:02:46,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,682 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9361#true} {9361#true} #442#return; {9361#true} is VALID [2022-04-27 15:02:46,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:46,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {9401#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {9361#true} is VALID [2022-04-27 15:02:46,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,692 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9361#true} {9361#true} #444#return; {9361#true} is VALID [2022-04-27 15:02:46,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 15:02:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:46,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 15:02:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:46,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 15:02:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:46,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {9416#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {9361#true} is VALID [2022-04-27 15:02:46,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9361#true} {9361#true} #440#return; {9361#true} is VALID [2022-04-27 15:02:46,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {9416#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {9361#true} is VALID [2022-04-27 15:02:46,739 INFO L272 TraceCheckUtils]: 1: Hoare triple {9361#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {9416#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:46,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {9416#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {9361#true} is VALID [2022-04-27 15:02:46,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,739 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9361#true} {9361#true} #440#return; {9361#true} is VALID [2022-04-27 15:02:46,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {9361#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {9361#true} is VALID [2022-04-27 15:02:46,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,739 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9361#true} {9361#true} #450#return; {9361#true} is VALID [2022-04-27 15:02:46,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:46,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {9420#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {9361#true} is VALID [2022-04-27 15:02:46,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9361#true} {9361#true} #452#return; {9361#true} is VALID [2022-04-27 15:02:46,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {9402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {9361#true} is VALID [2022-04-27 15:02:46,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {9361#true} assume 0 != ~compRegistered~0; {9361#true} is VALID [2022-04-27 15:02:46,746 INFO L272 TraceCheckUtils]: 2: Hoare triple {9361#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {9416#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:46,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {9416#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {9361#true} is VALID [2022-04-27 15:02:46,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {9361#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {9416#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:46,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {9416#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {9361#true} is VALID [2022-04-27 15:02:46,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,747 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9361#true} {9361#true} #440#return; {9361#true} is VALID [2022-04-27 15:02:46,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {9361#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {9361#true} is VALID [2022-04-27 15:02:46,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,747 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9361#true} {9361#true} #450#return; {9361#true} is VALID [2022-04-27 15:02:46,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {9361#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {9361#true} is VALID [2022-04-27 15:02:46,754 INFO L272 TraceCheckUtils]: 12: Hoare triple {9361#true} call stubMoreProcessingRequired(); {9420#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:46,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {9420#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {9361#true} is VALID [2022-04-27 15:02:46,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,763 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9361#true} {9361#true} #452#return; {9361#true} is VALID [2022-04-27 15:02:46,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {9361#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {9361#true} is VALID [2022-04-27 15:02:46,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {9361#true} assume 0 == ~tmp_ndt_2~0; {9361#true} is VALID [2022-04-27 15:02:46,778 INFO L290 TraceCheckUtils]: 18: Hoare triple {9361#true} ~returnVal2~0 := 0; {9414#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:46,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {9414#(<= IofCallDriver_~returnVal2~0 0)} assume !(~s~0 == ~NP~0); {9414#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:46,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {9414#(<= IofCallDriver_~returnVal2~0 0)} assume ~s~0 == ~MPR1~0; {9414#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:46,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {9414#(<= IofCallDriver_~returnVal2~0 0)} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {9414#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:46,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {9414#(<= IofCallDriver_~returnVal2~0 0)} #res := ~returnVal2~0; {9415#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-27 15:02:46,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {9415#(<= |IofCallDriver_#res| 0)} assume true; {9415#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-27 15:02:46,780 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9415#(<= |IofCallDriver_#res| 0)} {9361#true} #470#return; {9397#(not (= |KbFilter_PnP_#t~ret12| 259))} is VALID [2022-04-27 15:02:46,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {9361#true} call ULTIMATE.init(); {9399#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:46,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {9399#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {9361#true} is VALID [2022-04-27 15:02:46,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9361#true} {9361#true} #462#return; {9361#true} is VALID [2022-04-27 15:02:46,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {9361#true} call #t~ret35 := main(); {9361#true} is VALID [2022-04-27 15:02:46,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {9361#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {9361#true} is VALID [2022-04-27 15:02:46,782 INFO L272 TraceCheckUtils]: 6: Hoare triple {9361#true} call _BLAST_init(); {9400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:46,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {9400#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {9361#true} is VALID [2022-04-27 15:02:46,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,782 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {9361#true} {9361#true} #442#return; {9361#true} is VALID [2022-04-27 15:02:46,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {9361#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {9361#true} is VALID [2022-04-27 15:02:46,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {9361#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {9361#true} is VALID [2022-04-27 15:02:46,783 INFO L272 TraceCheckUtils]: 12: Hoare triple {9361#true} call stub_driver_init(); {9401#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:46,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {9401#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {9361#true} is VALID [2022-04-27 15:02:46,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,783 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9361#true} {9361#true} #444#return; {9361#true} is VALID [2022-04-27 15:02:46,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {9361#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {9361#true} is VALID [2022-04-27 15:02:46,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {9361#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {9361#true} is VALID [2022-04-27 15:02:46,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {9361#true} assume 3 == ~tmp_ndt_1~0; {9361#true} is VALID [2022-04-27 15:02:46,783 INFO L272 TraceCheckUtils]: 19: Hoare triple {9361#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {9361#true} is VALID [2022-04-27 15:02:46,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {9361#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {9361#true} is VALID [2022-04-27 15:02:46,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {9361#true} assume 0 == ~irpStack__MinorFunction~0; {9361#true} is VALID [2022-04-27 15:02:46,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {9361#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {9361#true} is VALID [2022-04-27 15:02:46,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {9361#true} assume !(~s~0 != ~NP~0); {9361#true} is VALID [2022-04-27 15:02:46,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {9361#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {9361#true} is VALID [2022-04-27 15:02:46,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {9361#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {9361#true} is VALID [2022-04-27 15:02:46,784 INFO L272 TraceCheckUtils]: 26: Hoare triple {9361#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {9402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:46,784 INFO L290 TraceCheckUtils]: 27: Hoare triple {9402#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {9361#true} is VALID [2022-04-27 15:02:46,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {9361#true} assume 0 != ~compRegistered~0; {9361#true} is VALID [2022-04-27 15:02:46,785 INFO L272 TraceCheckUtils]: 29: Hoare triple {9361#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {9416#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:46,785 INFO L290 TraceCheckUtils]: 30: Hoare triple {9416#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {9361#true} is VALID [2022-04-27 15:02:46,785 INFO L272 TraceCheckUtils]: 31: Hoare triple {9361#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {9416#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:46,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {9416#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {9361#true} is VALID [2022-04-27 15:02:46,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,786 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9361#true} {9361#true} #440#return; {9361#true} is VALID [2022-04-27 15:02:46,786 INFO L290 TraceCheckUtils]: 35: Hoare triple {9361#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {9361#true} is VALID [2022-04-27 15:02:46,786 INFO L290 TraceCheckUtils]: 36: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,786 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9361#true} {9361#true} #450#return; {9361#true} is VALID [2022-04-27 15:02:46,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {9361#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {9361#true} is VALID [2022-04-27 15:02:46,786 INFO L272 TraceCheckUtils]: 39: Hoare triple {9361#true} call stubMoreProcessingRequired(); {9420#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:46,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {9420#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {9361#true} is VALID [2022-04-27 15:02:46,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {9361#true} assume true; {9361#true} is VALID [2022-04-27 15:02:46,786 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9361#true} {9361#true} #452#return; {9361#true} is VALID [2022-04-27 15:02:46,786 INFO L290 TraceCheckUtils]: 43: Hoare triple {9361#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {9361#true} is VALID [2022-04-27 15:02:46,786 INFO L290 TraceCheckUtils]: 44: Hoare triple {9361#true} assume 0 == ~tmp_ndt_2~0; {9361#true} is VALID [2022-04-27 15:02:46,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {9361#true} ~returnVal2~0 := 0; {9414#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:46,787 INFO L290 TraceCheckUtils]: 46: Hoare triple {9414#(<= IofCallDriver_~returnVal2~0 0)} assume !(~s~0 == ~NP~0); {9414#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:46,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {9414#(<= IofCallDriver_~returnVal2~0 0)} assume ~s~0 == ~MPR1~0; {9414#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:46,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {9414#(<= IofCallDriver_~returnVal2~0 0)} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {9414#(<= IofCallDriver_~returnVal2~0 0)} is VALID [2022-04-27 15:02:46,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {9414#(<= IofCallDriver_~returnVal2~0 0)} #res := ~returnVal2~0; {9415#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-27 15:02:46,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {9415#(<= |IofCallDriver_#res| 0)} assume true; {9415#(<= |IofCallDriver_#res| 0)} is VALID [2022-04-27 15:02:46,788 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {9415#(<= |IofCallDriver_#res| 0)} {9361#true} #470#return; {9397#(not (= |KbFilter_PnP_#t~ret12| 259))} is VALID [2022-04-27 15:02:46,789 INFO L290 TraceCheckUtils]: 52: Hoare triple {9397#(not (= |KbFilter_PnP_#t~ret12| 259))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {9398#(not (= KbFilter_PnP_~__cil_tmp23~0 259))} is VALID [2022-04-27 15:02:46,789 INFO L290 TraceCheckUtils]: 53: Hoare triple {9398#(not (= KbFilter_PnP_~__cil_tmp23~0 259))} assume 259 == ~__cil_tmp23~0; {9362#false} is VALID [2022-04-27 15:02:46,789 INFO L272 TraceCheckUtils]: 54: Hoare triple {9362#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {9362#false} is VALID [2022-04-27 15:02:46,789 INFO L290 TraceCheckUtils]: 55: Hoare triple {9362#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {9362#false} is VALID [2022-04-27 15:02:46,789 INFO L290 TraceCheckUtils]: 56: Hoare triple {9362#false} assume !(~s~0 == ~MPR3~0); {9362#false} is VALID [2022-04-27 15:02:46,789 INFO L290 TraceCheckUtils]: 57: Hoare triple {9362#false} assume !(1 == ~customIrp~0); {9362#false} is VALID [2022-04-27 15:02:46,789 INFO L290 TraceCheckUtils]: 58: Hoare triple {9362#false} assume ~s~0 == ~MPR3~0; {9362#false} is VALID [2022-04-27 15:02:46,789 INFO L272 TraceCheckUtils]: 59: Hoare triple {9362#false} call errorFn(); {9362#false} is VALID [2022-04-27 15:02:46,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {9362#false} assume !false; {9362#false} is VALID [2022-04-27 15:02:46,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:46,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:46,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162612676] [2022-04-27 15:02:46,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162612676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:46,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:46,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-27 15:02:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027843621] [2022-04-27 15:02:46,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:46,791 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-04-27 15:02:46,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:46,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:46,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:46,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 15:02:46,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:46,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 15:02:46,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-27 15:02:46,825 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:47,350 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2022-04-27 15:02:47,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 15:02:47,353 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2022-04-27 15:02:47,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-04-27 15:02:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:47,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-04-27 15:02:47,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 112 transitions. [2022-04-27 15:02:47,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:47,432 INFO L225 Difference]: With dead ends: 112 [2022-04-27 15:02:47,432 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 15:02:47,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-27 15:02:47,432 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 84 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:47,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 305 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 15:02:47,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 15:02:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-04-27 15:02:47,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:47,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:47,449 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:47,449 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:47,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:47,450 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-04-27 15:02:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-04-27 15:02:47,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:47,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:47,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 93 states. [2022-04-27 15:02:47,461 INFO L87 Difference]: Start difference. First operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 93 states. [2022-04-27 15:02:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:47,462 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2022-04-27 15:02:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-04-27 15:02:47,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:47,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:47,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:47,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 66 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-04-27 15:02:47,464 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 61 [2022-04-27 15:02:47,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:47,464 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-04-27 15:02:47,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-04-27 15:02:47,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-27 15:02:47,465 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:47,465 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:47,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:02:47,465 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:47,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:47,465 INFO L85 PathProgramCache]: Analyzing trace with hash 457949083, now seen corresponding path program 1 times [2022-04-27 15:02:47,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:47,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334307213] [2022-04-27 15:02:47,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:47,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:47,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {9927#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {9889#true} is VALID [2022-04-27 15:02:47,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9889#true} {9889#true} #462#return; {9889#true} is VALID [2022-04-27 15:02:47,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:47,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {9928#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {9889#true} is VALID [2022-04-27 15:02:47,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9889#true} {9889#true} #442#return; {9889#true} is VALID [2022-04-27 15:02:47,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:47,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {9929#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {9889#true} is VALID [2022-04-27 15:02:47,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9889#true} {9889#true} #444#return; {9889#true} is VALID [2022-04-27 15:02:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 15:02:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 15:02:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:47,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 15:02:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:47,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {9942#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {9889#true} is VALID [2022-04-27 15:02:47,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9889#true} {9889#true} #440#return; {9889#true} is VALID [2022-04-27 15:02:47,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {9942#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {9889#true} is VALID [2022-04-27 15:02:47,584 INFO L272 TraceCheckUtils]: 1: Hoare triple {9889#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {9942#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:47,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {9942#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {9889#true} is VALID [2022-04-27 15:02:47,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,585 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9889#true} {9889#true} #440#return; {9889#true} is VALID [2022-04-27 15:02:47,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {9889#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {9889#true} is VALID [2022-04-27 15:02:47,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,585 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9889#true} {9889#true} #450#return; {9889#true} is VALID [2022-04-27 15:02:47,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:47,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {9946#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {9889#true} is VALID [2022-04-27 15:02:47,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9889#true} {9889#true} #452#return; {9889#true} is VALID [2022-04-27 15:02:47,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {9930#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {9889#true} is VALID [2022-04-27 15:02:47,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {9889#true} assume 0 != ~compRegistered~0; {9889#true} is VALID [2022-04-27 15:02:47,592 INFO L272 TraceCheckUtils]: 2: Hoare triple {9889#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {9942#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:47,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {9942#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {9889#true} is VALID [2022-04-27 15:02:47,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {9889#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {9942#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:47,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {9942#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {9889#true} is VALID [2022-04-27 15:02:47,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,593 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9889#true} {9889#true} #440#return; {9889#true} is VALID [2022-04-27 15:02:47,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {9889#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {9889#true} is VALID [2022-04-27 15:02:47,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9889#true} {9889#true} #450#return; {9889#true} is VALID [2022-04-27 15:02:47,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {9889#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {9889#true} is VALID [2022-04-27 15:02:47,593 INFO L272 TraceCheckUtils]: 12: Hoare triple {9889#true} call stubMoreProcessingRequired(); {9946#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:47,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {9946#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {9889#true} is VALID [2022-04-27 15:02:47,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,593 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9889#true} {9889#true} #452#return; {9889#true} is VALID [2022-04-27 15:02:47,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {9889#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {9889#true} is VALID [2022-04-27 15:02:47,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {9889#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {9889#true} is VALID [2022-04-27 15:02:47,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {9889#true} assume !(1 == ~tmp_ndt_3~0); {9889#true} is VALID [2022-04-27 15:02:47,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {9889#true} ~returnVal2~0 := 259; {9889#true} is VALID [2022-04-27 15:02:47,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {9889#true} assume !(~s~0 == ~NP~0); {9889#true} is VALID [2022-04-27 15:02:47,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {9889#true} assume ~s~0 == ~MPR1~0; {9889#true} is VALID [2022-04-27 15:02:47,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {9889#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {9889#true} is VALID [2022-04-27 15:02:47,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {9889#true} #res := ~returnVal2~0; {9889#true} is VALID [2022-04-27 15:02:47,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,594 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {9889#true} {9889#true} #470#return; {9889#true} is VALID [2022-04-27 15:02:47,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {9889#true} call ULTIMATE.init(); {9927#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:47,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {9927#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {9889#true} is VALID [2022-04-27 15:02:47,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9889#true} {9889#true} #462#return; {9889#true} is VALID [2022-04-27 15:02:47,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {9889#true} call #t~ret35 := main(); {9889#true} is VALID [2022-04-27 15:02:47,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {9889#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {9889#true} is VALID [2022-04-27 15:02:47,596 INFO L272 TraceCheckUtils]: 6: Hoare triple {9889#true} call _BLAST_init(); {9928#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:47,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {9928#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {9889#true} is VALID [2022-04-27 15:02:47,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,597 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {9889#true} {9889#true} #442#return; {9889#true} is VALID [2022-04-27 15:02:47,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {9889#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {9889#true} is VALID [2022-04-27 15:02:47,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {9889#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {9889#true} is VALID [2022-04-27 15:02:47,597 INFO L272 TraceCheckUtils]: 12: Hoare triple {9889#true} call stub_driver_init(); {9929#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:47,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {9929#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {9889#true} is VALID [2022-04-27 15:02:47,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,597 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9889#true} {9889#true} #444#return; {9889#true} is VALID [2022-04-27 15:02:47,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {9889#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {9889#true} is VALID [2022-04-27 15:02:47,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {9889#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {9889#true} is VALID [2022-04-27 15:02:47,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {9889#true} assume 3 == ~tmp_ndt_1~0; {9889#true} is VALID [2022-04-27 15:02:47,598 INFO L272 TraceCheckUtils]: 19: Hoare triple {9889#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {9889#true} is VALID [2022-04-27 15:02:47,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {9889#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {9889#true} is VALID [2022-04-27 15:02:47,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {9889#true} assume 0 == ~irpStack__MinorFunction~0; {9889#true} is VALID [2022-04-27 15:02:47,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {9889#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {9889#true} is VALID [2022-04-27 15:02:47,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {9889#true} assume !(~s~0 != ~NP~0); {9889#true} is VALID [2022-04-27 15:02:47,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {9889#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {9889#true} is VALID [2022-04-27 15:02:47,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {9889#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {9889#true} is VALID [2022-04-27 15:02:47,599 INFO L272 TraceCheckUtils]: 26: Hoare triple {9889#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {9930#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:47,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {9930#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {9889#true} is VALID [2022-04-27 15:02:47,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {9889#true} assume 0 != ~compRegistered~0; {9889#true} is VALID [2022-04-27 15:02:47,599 INFO L272 TraceCheckUtils]: 29: Hoare triple {9889#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {9942#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:47,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {9942#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {9889#true} is VALID [2022-04-27 15:02:47,600 INFO L272 TraceCheckUtils]: 31: Hoare triple {9889#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {9942#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:47,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {9942#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {9889#true} is VALID [2022-04-27 15:02:47,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,600 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9889#true} {9889#true} #440#return; {9889#true} is VALID [2022-04-27 15:02:47,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {9889#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {9889#true} is VALID [2022-04-27 15:02:47,600 INFO L290 TraceCheckUtils]: 36: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,600 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {9889#true} {9889#true} #450#return; {9889#true} is VALID [2022-04-27 15:02:47,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {9889#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L272 TraceCheckUtils]: 39: Hoare triple {9889#true} call stubMoreProcessingRequired(); {9946#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:47,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {9946#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {9889#true} {9889#true} #452#return; {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L290 TraceCheckUtils]: 43: Hoare triple {9889#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {9889#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L290 TraceCheckUtils]: 45: Hoare triple {9889#true} assume !(1 == ~tmp_ndt_3~0); {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L290 TraceCheckUtils]: 46: Hoare triple {9889#true} ~returnVal2~0 := 259; {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L290 TraceCheckUtils]: 47: Hoare triple {9889#true} assume !(~s~0 == ~NP~0); {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L290 TraceCheckUtils]: 48: Hoare triple {9889#true} assume ~s~0 == ~MPR1~0; {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L290 TraceCheckUtils]: 49: Hoare triple {9889#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L290 TraceCheckUtils]: 50: Hoare triple {9889#true} #res := ~returnVal2~0; {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L290 TraceCheckUtils]: 51: Hoare triple {9889#true} assume true; {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9889#true} {9889#true} #470#return; {9889#true} is VALID [2022-04-27 15:02:47,601 INFO L290 TraceCheckUtils]: 53: Hoare triple {9889#true} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {9889#true} is VALID [2022-04-27 15:02:47,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {9889#true} assume 259 == ~__cil_tmp23~0; {9889#true} is VALID [2022-04-27 15:02:47,602 INFO L272 TraceCheckUtils]: 55: Hoare triple {9889#true} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {9889#true} is VALID [2022-04-27 15:02:47,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {9889#true} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {9889#true} is VALID [2022-04-27 15:02:47,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {9889#true} assume !(~s~0 == ~MPR3~0); {9926#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-27 15:02:47,602 INFO L290 TraceCheckUtils]: 58: Hoare triple {9926#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {9926#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-27 15:02:47,602 INFO L290 TraceCheckUtils]: 59: Hoare triple {9926#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {9890#false} is VALID [2022-04-27 15:02:47,603 INFO L272 TraceCheckUtils]: 60: Hoare triple {9890#false} call errorFn(); {9890#false} is VALID [2022-04-27 15:02:47,603 INFO L290 TraceCheckUtils]: 61: Hoare triple {9890#false} assume !false; {9890#false} is VALID [2022-04-27 15:02:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:47,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:47,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334307213] [2022-04-27 15:02:47,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334307213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:47,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:47,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 15:02:47,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963259321] [2022-04-27 15:02:47,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:47,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-27 15:02:47,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:47,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:47,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:47,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 15:02:47,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:47,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 15:02:47,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-27 15:02:47,640 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:48,026 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-04-27 15:02:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:02:48,026 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-27 15:02:48,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-04-27 15:02:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:48,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2022-04-27 15:02:48,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 100 transitions. [2022-04-27 15:02:48,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:48,108 INFO L225 Difference]: With dead ends: 105 [2022-04-27 15:02:48,108 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 15:02:48,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-27 15:02:48,109 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 127 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:48,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 180 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:02:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 15:02:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2022-04-27 15:02:48,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:48,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:48,127 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:48,127 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:48,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:48,128 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-04-27 15:02:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-04-27 15:02:48,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:48,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:48,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 100 states. [2022-04-27 15:02:48,129 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 100 states. [2022-04-27 15:02:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:48,130 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2022-04-27 15:02:48,130 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-04-27 15:02:48,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:48,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:48,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:48,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 68 states have internal predecessors, (75), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2022-04-27 15:02:48,132 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 62 [2022-04-27 15:02:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:48,132 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2022-04-27 15:02:48,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2022-04-27 15:02:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-27 15:02:48,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:48,133 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:48,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:02:48,133 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:48,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1607349772, now seen corresponding path program 1 times [2022-04-27 15:02:48,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:48,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544956298] [2022-04-27 15:02:48,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:48,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:48,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {10463#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {10424#true} is VALID [2022-04-27 15:02:48,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10424#true} {10424#true} #462#return; {10424#true} is VALID [2022-04-27 15:02:48,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:48,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:48,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {10464#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10424#true} is VALID [2022-04-27 15:02:48,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10424#true} {10424#true} #442#return; {10424#true} is VALID [2022-04-27 15:02:48,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:48,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {10465#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10424#true} is VALID [2022-04-27 15:02:48,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10424#true} {10424#true} #444#return; {10424#true} is VALID [2022-04-27 15:02:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 15:02:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:48,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 15:02:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:48,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 15:02:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:48,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {10480#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10424#true} is VALID [2022-04-27 15:02:48,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10424#true} {10424#true} #440#return; {10424#true} is VALID [2022-04-27 15:02:48,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {10480#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {10424#true} is VALID [2022-04-27 15:02:48,287 INFO L272 TraceCheckUtils]: 1: Hoare triple {10424#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {10480#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:48,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {10480#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10424#true} is VALID [2022-04-27 15:02:48,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,288 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10424#true} {10424#true} #440#return; {10424#true} is VALID [2022-04-27 15:02:48,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {10424#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {10424#true} is VALID [2022-04-27 15:02:48,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,288 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10424#true} {10424#true} #450#return; {10424#true} is VALID [2022-04-27 15:02:48,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:48,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {10484#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {10424#true} is VALID [2022-04-27 15:02:48,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10424#true} {10424#true} #452#return; {10424#true} is VALID [2022-04-27 15:02:48,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {10466#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {10424#true} is VALID [2022-04-27 15:02:48,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {10424#true} assume 0 != ~compRegistered~0; {10424#true} is VALID [2022-04-27 15:02:48,302 INFO L272 TraceCheckUtils]: 2: Hoare triple {10424#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {10480#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:48,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {10480#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {10424#true} is VALID [2022-04-27 15:02:48,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {10424#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {10480#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:48,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {10480#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10424#true} is VALID [2022-04-27 15:02:48,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,302 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10424#true} {10424#true} #440#return; {10424#true} is VALID [2022-04-27 15:02:48,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {10424#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {10424#true} is VALID [2022-04-27 15:02:48,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,303 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10424#true} {10424#true} #450#return; {10424#true} is VALID [2022-04-27 15:02:48,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {10424#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {10424#true} is VALID [2022-04-27 15:02:48,303 INFO L272 TraceCheckUtils]: 12: Hoare triple {10424#true} call stubMoreProcessingRequired(); {10484#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:48,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {10484#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {10424#true} is VALID [2022-04-27 15:02:48,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,303 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10424#true} {10424#true} #452#return; {10424#true} is VALID [2022-04-27 15:02:48,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {10424#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {10424#true} is VALID [2022-04-27 15:02:48,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {10424#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {10424#true} is VALID [2022-04-27 15:02:48,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {10424#true} assume !(1 == ~tmp_ndt_3~0); {10424#true} is VALID [2022-04-27 15:02:48,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {10424#true} ~returnVal2~0 := 259; {10478#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-27 15:02:48,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {10478#(<= 259 IofCallDriver_~returnVal2~0)} assume !(~s~0 == ~NP~0); {10478#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-27 15:02:48,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {10478#(<= 259 IofCallDriver_~returnVal2~0)} assume ~s~0 == ~MPR1~0; {10478#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-27 15:02:48,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {10478#(<= 259 IofCallDriver_~returnVal2~0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {10478#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-27 15:02:48,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {10478#(<= 259 IofCallDriver_~returnVal2~0)} #res := ~returnVal2~0; {10479#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-27 15:02:48,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {10479#(<= 259 |IofCallDriver_#res|)} assume true; {10479#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-27 15:02:48,305 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10479#(<= 259 |IofCallDriver_#res|)} {10424#true} #470#return; {10461#(<= 259 |KbFilter_PnP_#t~ret12|)} is VALID [2022-04-27 15:02:48,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {10424#true} call ULTIMATE.init(); {10463#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:48,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {10463#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {10424#true} is VALID [2022-04-27 15:02:48,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10424#true} {10424#true} #462#return; {10424#true} is VALID [2022-04-27 15:02:48,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {10424#true} call #t~ret35 := main(); {10424#true} is VALID [2022-04-27 15:02:48,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {10424#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {10424#true} is VALID [2022-04-27 15:02:48,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {10424#true} call _BLAST_init(); {10464#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:48,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {10464#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10424#true} is VALID [2022-04-27 15:02:48,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,308 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {10424#true} {10424#true} #442#return; {10424#true} is VALID [2022-04-27 15:02:48,308 INFO L290 TraceCheckUtils]: 10: Hoare triple {10424#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {10424#true} is VALID [2022-04-27 15:02:48,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {10424#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L272 TraceCheckUtils]: 12: Hoare triple {10424#true} call stub_driver_init(); {10465#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:48,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {10465#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10424#true} {10424#true} #444#return; {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {10424#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {10424#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {10424#true} assume 3 == ~tmp_ndt_1~0; {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L272 TraceCheckUtils]: 19: Hoare triple {10424#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {10424#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {10424#true} assume 0 == ~irpStack__MinorFunction~0; {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {10424#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {10424#true} assume !(~s~0 != ~NP~0); {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {10424#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {10424#true} is VALID [2022-04-27 15:02:48,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {10424#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {10424#true} is VALID [2022-04-27 15:02:48,310 INFO L272 TraceCheckUtils]: 26: Hoare triple {10424#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {10466#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:48,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {10466#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {10424#true} is VALID [2022-04-27 15:02:48,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {10424#true} assume 0 != ~compRegistered~0; {10424#true} is VALID [2022-04-27 15:02:48,310 INFO L272 TraceCheckUtils]: 29: Hoare triple {10424#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {10480#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:48,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {10480#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {10424#true} is VALID [2022-04-27 15:02:48,311 INFO L272 TraceCheckUtils]: 31: Hoare triple {10424#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {10480#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:48,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {10480#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10424#true} is VALID [2022-04-27 15:02:48,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,311 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10424#true} {10424#true} #440#return; {10424#true} is VALID [2022-04-27 15:02:48,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {10424#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {10424#true} is VALID [2022-04-27 15:02:48,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,311 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10424#true} {10424#true} #450#return; {10424#true} is VALID [2022-04-27 15:02:48,311 INFO L290 TraceCheckUtils]: 38: Hoare triple {10424#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {10424#true} is VALID [2022-04-27 15:02:48,312 INFO L272 TraceCheckUtils]: 39: Hoare triple {10424#true} call stubMoreProcessingRequired(); {10484#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:48,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {10484#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {10424#true} is VALID [2022-04-27 15:02:48,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {10424#true} assume true; {10424#true} is VALID [2022-04-27 15:02:48,312 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10424#true} {10424#true} #452#return; {10424#true} is VALID [2022-04-27 15:02:48,312 INFO L290 TraceCheckUtils]: 43: Hoare triple {10424#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {10424#true} is VALID [2022-04-27 15:02:48,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {10424#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {10424#true} is VALID [2022-04-27 15:02:48,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {10424#true} assume !(1 == ~tmp_ndt_3~0); {10424#true} is VALID [2022-04-27 15:02:48,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {10424#true} ~returnVal2~0 := 259; {10478#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-27 15:02:48,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {10478#(<= 259 IofCallDriver_~returnVal2~0)} assume !(~s~0 == ~NP~0); {10478#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-27 15:02:48,313 INFO L290 TraceCheckUtils]: 48: Hoare triple {10478#(<= 259 IofCallDriver_~returnVal2~0)} assume ~s~0 == ~MPR1~0; {10478#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-27 15:02:48,313 INFO L290 TraceCheckUtils]: 49: Hoare triple {10478#(<= 259 IofCallDriver_~returnVal2~0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {10478#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-27 15:02:48,313 INFO L290 TraceCheckUtils]: 50: Hoare triple {10478#(<= 259 IofCallDriver_~returnVal2~0)} #res := ~returnVal2~0; {10479#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-27 15:02:48,314 INFO L290 TraceCheckUtils]: 51: Hoare triple {10479#(<= 259 |IofCallDriver_#res|)} assume true; {10479#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-27 15:02:48,314 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10479#(<= 259 |IofCallDriver_#res|)} {10424#true} #470#return; {10461#(<= 259 |KbFilter_PnP_#t~ret12|)} is VALID [2022-04-27 15:02:48,314 INFO L290 TraceCheckUtils]: 53: Hoare triple {10461#(<= 259 |KbFilter_PnP_#t~ret12|)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {10462#(<= 259 KbFilter_PnP_~status~0)} is VALID [2022-04-27 15:02:48,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {10462#(<= 259 KbFilter_PnP_~status~0)} assume !(259 == ~__cil_tmp23~0); {10462#(<= 259 KbFilter_PnP_~status~0)} is VALID [2022-04-27 15:02:48,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {10462#(<= 259 KbFilter_PnP_~status~0)} assume !(~status~0 >= 0); {10425#false} is VALID [2022-04-27 15:02:48,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {10425#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {10425#false} is VALID [2022-04-27 15:02:48,315 INFO L272 TraceCheckUtils]: 57: Hoare triple {10425#false} call IofCompleteRequest(~Irp, 0); {10425#false} is VALID [2022-04-27 15:02:48,315 INFO L290 TraceCheckUtils]: 58: Hoare triple {10425#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {10425#false} is VALID [2022-04-27 15:02:48,315 INFO L290 TraceCheckUtils]: 59: Hoare triple {10425#false} assume !(~s~0 == ~NP~0); {10425#false} is VALID [2022-04-27 15:02:48,315 INFO L272 TraceCheckUtils]: 60: Hoare triple {10425#false} call errorFn(); {10425#false} is VALID [2022-04-27 15:02:48,316 INFO L290 TraceCheckUtils]: 61: Hoare triple {10425#false} assume !false; {10425#false} is VALID [2022-04-27 15:02:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:48,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:48,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544956298] [2022-04-27 15:02:48,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544956298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:48,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:48,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-27 15:02:48,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769792479] [2022-04-27 15:02:48,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:48,317 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-27 15:02:48,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:48,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:48,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:48,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 15:02:48,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:48,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 15:02:48,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-27 15:02:48,351 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:48,973 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-04-27 15:02:48,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 15:02:48,973 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-04-27 15:02:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-27 15:02:48,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-27 15:02:48,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-27 15:02:49,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:49,035 INFO L225 Difference]: With dead ends: 98 [2022-04-27 15:02:49,035 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 15:02:49,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-27 15:02:49,036 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 86 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:49,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 256 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 15:02:49,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 15:02:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-27 15:02:49,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:49,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:49,067 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:49,067 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:49,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:49,069 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-04-27 15:02:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-27 15:02:49,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:49,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:49,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-27 15:02:49,069 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 91 states. [2022-04-27 15:02:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:49,070 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-04-27 15:02:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-27 15:02:49,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:49,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:49,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:49,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 68 states have internal predecessors, (74), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-27 15:02:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-04-27 15:02:49,072 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 62 [2022-04-27 15:02:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:49,072 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-04-27 15:02:49,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-04-27 15:02:49,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 15:02:49,072 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:49,073 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:49,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:02:49,073 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:49,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:49,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1073874348, now seen corresponding path program 1 times [2022-04-27 15:02:49,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:49,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929254068] [2022-04-27 15:02:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:49,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {10972#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {10934#true} is VALID [2022-04-27 15:02:49,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {10934#true} assume true; {10934#true} is VALID [2022-04-27 15:02:49,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10934#true} {10934#true} #462#return; {10934#true} is VALID [2022-04-27 15:02:49,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {10973#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10934#true} is VALID [2022-04-27 15:02:49,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {10934#true} assume true; {10934#true} is VALID [2022-04-27 15:02:49,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10934#true} {10934#true} #442#return; {10934#true} is VALID [2022-04-27 15:02:49,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {10974#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10934#true} is VALID [2022-04-27 15:02:49,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {10934#true} assume true; {10934#true} is VALID [2022-04-27 15:02:49,166 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10934#true} {10934#true} #444#return; {10934#true} is VALID [2022-04-27 15:02:49,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 15:02:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 15:02:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 15:02:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {10987#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {10971#(= ~setEventCalled~0 1)} assume true; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10971#(= ~setEventCalled~0 1)} {10934#true} #440#return; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {10987#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {10934#true} is VALID [2022-04-27 15:02:49,199 INFO L272 TraceCheckUtils]: 1: Hoare triple {10934#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {10987#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:49,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {10987#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {10971#(= ~setEventCalled~0 1)} assume true; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,200 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10971#(= ~setEventCalled~0 1)} {10934#true} #440#return; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {10971#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {10971#(= ~setEventCalled~0 1)} assume true; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,201 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10971#(= ~setEventCalled~0 1)} {10934#true} #450#return; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {10991#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {10934#true} is VALID [2022-04-27 15:02:49,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {10934#true} assume true; {10934#true} is VALID [2022-04-27 15:02:49,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10934#true} {10971#(= ~setEventCalled~0 1)} #452#return; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {10975#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {10934#true} is VALID [2022-04-27 15:02:49,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {10934#true} assume 0 != ~compRegistered~0; {10934#true} is VALID [2022-04-27 15:02:49,211 INFO L272 TraceCheckUtils]: 2: Hoare triple {10934#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {10987#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:49,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {10987#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {10934#true} is VALID [2022-04-27 15:02:49,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {10934#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {10987#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:49,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {10987#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {10971#(= ~setEventCalled~0 1)} assume true; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,213 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10971#(= ~setEventCalled~0 1)} {10934#true} #440#return; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {10971#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {10971#(= ~setEventCalled~0 1)} assume true; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10971#(= ~setEventCalled~0 1)} {10934#true} #450#return; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {10971#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,214 INFO L272 TraceCheckUtils]: 12: Hoare triple {10971#(= ~setEventCalled~0 1)} call stubMoreProcessingRequired(); {10991#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:49,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {10991#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {10934#true} is VALID [2022-04-27 15:02:49,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {10934#true} assume true; {10934#true} is VALID [2022-04-27 15:02:49,215 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10934#true} {10971#(= ~setEventCalled~0 1)} #452#return; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {10971#(= ~setEventCalled~0 1)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {10971#(= ~setEventCalled~0 1)} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {10971#(= ~setEventCalled~0 1)} assume !(1 == ~tmp_ndt_3~0); {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {10971#(= ~setEventCalled~0 1)} ~returnVal2~0 := 259; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {10971#(= ~setEventCalled~0 1)} assume !(~s~0 == ~NP~0); {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {10971#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR1~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {10971#(= ~setEventCalled~0 1)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {10971#(= ~setEventCalled~0 1)} #res := ~returnVal2~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {10971#(= ~setEventCalled~0 1)} assume true; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,218 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10971#(= ~setEventCalled~0 1)} {10934#true} #470#return; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {10934#true} call ULTIMATE.init(); {10972#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:49,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {10972#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {10934#true} is VALID [2022-04-27 15:02:49,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {10934#true} assume true; {10934#true} is VALID [2022-04-27 15:02:49,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10934#true} {10934#true} #462#return; {10934#true} is VALID [2022-04-27 15:02:49,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {10934#true} call #t~ret35 := main(); {10934#true} is VALID [2022-04-27 15:02:49,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {10934#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {10934#true} is VALID [2022-04-27 15:02:49,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {10934#true} call _BLAST_init(); {10973#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:49,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {10973#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10934#true} is VALID [2022-04-27 15:02:49,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {10934#true} assume true; {10934#true} is VALID [2022-04-27 15:02:49,221 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {10934#true} {10934#true} #442#return; {10934#true} is VALID [2022-04-27 15:02:49,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {10934#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {10934#true} is VALID [2022-04-27 15:02:49,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {10934#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {10934#true} is VALID [2022-04-27 15:02:49,221 INFO L272 TraceCheckUtils]: 12: Hoare triple {10934#true} call stub_driver_init(); {10974#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:49,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {10974#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {10934#true} is VALID [2022-04-27 15:02:49,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {10934#true} assume true; {10934#true} is VALID [2022-04-27 15:02:49,222 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10934#true} {10934#true} #444#return; {10934#true} is VALID [2022-04-27 15:02:49,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {10934#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {10934#true} is VALID [2022-04-27 15:02:49,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {10934#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {10934#true} is VALID [2022-04-27 15:02:49,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {10934#true} assume 3 == ~tmp_ndt_1~0; {10934#true} is VALID [2022-04-27 15:02:49,222 INFO L272 TraceCheckUtils]: 19: Hoare triple {10934#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {10934#true} is VALID [2022-04-27 15:02:49,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {10934#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {10934#true} is VALID [2022-04-27 15:02:49,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {10934#true} assume 0 == ~irpStack__MinorFunction~0; {10934#true} is VALID [2022-04-27 15:02:49,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {10934#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {10934#true} is VALID [2022-04-27 15:02:49,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {10934#true} assume !(~s~0 != ~NP~0); {10934#true} is VALID [2022-04-27 15:02:49,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {10934#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {10934#true} is VALID [2022-04-27 15:02:49,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {10934#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {10934#true} is VALID [2022-04-27 15:02:49,223 INFO L272 TraceCheckUtils]: 26: Hoare triple {10934#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {10975#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:49,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {10975#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {10934#true} is VALID [2022-04-27 15:02:49,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {10934#true} assume 0 != ~compRegistered~0; {10934#true} is VALID [2022-04-27 15:02:49,223 INFO L272 TraceCheckUtils]: 29: Hoare triple {10934#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {10987#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:49,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {10987#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {10934#true} is VALID [2022-04-27 15:02:49,224 INFO L272 TraceCheckUtils]: 31: Hoare triple {10934#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {10987#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:49,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {10987#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {10971#(= ~setEventCalled~0 1)} assume true; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,225 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10971#(= ~setEventCalled~0 1)} {10934#true} #440#return; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {10971#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,225 INFO L290 TraceCheckUtils]: 36: Hoare triple {10971#(= ~setEventCalled~0 1)} assume true; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,226 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {10971#(= ~setEventCalled~0 1)} {10934#true} #450#return; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {10971#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,226 INFO L272 TraceCheckUtils]: 39: Hoare triple {10971#(= ~setEventCalled~0 1)} call stubMoreProcessingRequired(); {10991#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:49,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {10991#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {10934#true} is VALID [2022-04-27 15:02:49,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {10934#true} assume true; {10934#true} is VALID [2022-04-27 15:02:49,227 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {10934#true} {10971#(= ~setEventCalled~0 1)} #452#return; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {10971#(= ~setEventCalled~0 1)} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,251 INFO L290 TraceCheckUtils]: 44: Hoare triple {10971#(= ~setEventCalled~0 1)} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,251 INFO L290 TraceCheckUtils]: 45: Hoare triple {10971#(= ~setEventCalled~0 1)} assume !(1 == ~tmp_ndt_3~0); {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,251 INFO L290 TraceCheckUtils]: 46: Hoare triple {10971#(= ~setEventCalled~0 1)} ~returnVal2~0 := 259; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,251 INFO L290 TraceCheckUtils]: 47: Hoare triple {10971#(= ~setEventCalled~0 1)} assume !(~s~0 == ~NP~0); {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,252 INFO L290 TraceCheckUtils]: 48: Hoare triple {10971#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR1~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,252 INFO L290 TraceCheckUtils]: 49: Hoare triple {10971#(= ~setEventCalled~0 1)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {10971#(= ~setEventCalled~0 1)} #res := ~returnVal2~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,252 INFO L290 TraceCheckUtils]: 51: Hoare triple {10971#(= ~setEventCalled~0 1)} assume true; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,253 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {10971#(= ~setEventCalled~0 1)} {10934#true} #470#return; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,253 INFO L290 TraceCheckUtils]: 53: Hoare triple {10971#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,254 INFO L290 TraceCheckUtils]: 54: Hoare triple {10971#(= ~setEventCalled~0 1)} assume 259 == ~__cil_tmp23~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,254 INFO L272 TraceCheckUtils]: 55: Hoare triple {10971#(= ~setEventCalled~0 1)} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,254 INFO L290 TraceCheckUtils]: 56: Hoare triple {10971#(= ~setEventCalled~0 1)} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,255 INFO L290 TraceCheckUtils]: 57: Hoare triple {10971#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR3~0; {10971#(= ~setEventCalled~0 1)} is VALID [2022-04-27 15:02:49,255 INFO L290 TraceCheckUtils]: 58: Hoare triple {10971#(= ~setEventCalled~0 1)} assume !(1 == ~setEventCalled~0); {10935#false} is VALID [2022-04-27 15:02:49,255 INFO L290 TraceCheckUtils]: 59: Hoare triple {10935#false} assume !(1 == ~customIrp~0); {10935#false} is VALID [2022-04-27 15:02:49,255 INFO L290 TraceCheckUtils]: 60: Hoare triple {10935#false} assume ~s~0 == ~MPR3~0; {10935#false} is VALID [2022-04-27 15:02:49,255 INFO L272 TraceCheckUtils]: 61: Hoare triple {10935#false} call errorFn(); {10935#false} is VALID [2022-04-27 15:02:49,255 INFO L290 TraceCheckUtils]: 62: Hoare triple {10935#false} assume !false; {10935#false} is VALID [2022-04-27 15:02:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:49,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:49,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929254068] [2022-04-27 15:02:49,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929254068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:49,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:49,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 15:02:49,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960807034] [2022-04-27 15:02:49,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:49,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-04-27 15:02:49,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:49,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:49,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:49,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 15:02:49,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:49,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 15:02:49,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-27 15:02:49,292 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:49,601 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2022-04-27 15:02:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:02:49,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-04-27 15:02:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-27 15:02:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:49,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2022-04-27 15:02:49,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 103 transitions. [2022-04-27 15:02:49,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:49,700 INFO L225 Difference]: With dead ends: 107 [2022-04-27 15:02:49,700 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 15:02:49,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-27 15:02:49,705 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 113 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:49,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 139 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:02:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 15:02:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-27 15:02:49,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:49,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 15:02:49,734 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 15:02:49,734 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 15:02:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:49,735 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-27 15:02:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-27 15:02:49,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:49,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:49,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-27 15:02:49,736 INFO L87 Difference]: Start difference. First operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-27 15:02:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:49,736 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-27 15:02:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-27 15:02:49,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:49,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:49,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:49,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 15:02:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-27 15:02:49,738 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 63 [2022-04-27 15:02:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:49,738 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-27 15:02:49,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-27 15:02:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 15:02:49,739 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:49,739 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:49,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:02:49,739 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:49,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:49,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1942054886, now seen corresponding path program 1 times [2022-04-27 15:02:49,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:49,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034059359] [2022-04-27 15:02:49,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:49,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {11444#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {11406#true} is VALID [2022-04-27 15:02:49,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11406#true} {11406#true} #462#return; {11406#true} is VALID [2022-04-27 15:02:49,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {11445#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {11406#true} is VALID [2022-04-27 15:02:49,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11406#true} {11406#true} #442#return; {11406#true} is VALID [2022-04-27 15:02:49,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {11446#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {11406#true} is VALID [2022-04-27 15:02:49,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11406#true} {11414#(<= (+ ~myStatus~0 1073741637) 0)} #444#return; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 15:02:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 15:02:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 15:02:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {11459#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11406#true} is VALID [2022-04-27 15:02:49,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11406#true} {11406#true} #440#return; {11406#true} is VALID [2022-04-27 15:02:49,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {11459#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11406#true} is VALID [2022-04-27 15:02:49,869 INFO L272 TraceCheckUtils]: 1: Hoare triple {11406#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11459#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:49,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {11459#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11406#true} is VALID [2022-04-27 15:02:49,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,869 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11406#true} {11406#true} #440#return; {11406#true} is VALID [2022-04-27 15:02:49,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {11406#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11406#true} is VALID [2022-04-27 15:02:49,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,869 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11406#true} {11406#true} #450#return; {11406#true} is VALID [2022-04-27 15:02:49,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:49,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {11463#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11406#true} is VALID [2022-04-27 15:02:49,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11406#true} {11406#true} #452#return; {11406#true} is VALID [2022-04-27 15:02:49,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {11447#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {11406#true} is VALID [2022-04-27 15:02:49,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {11406#true} assume 0 != ~compRegistered~0; {11406#true} is VALID [2022-04-27 15:02:49,877 INFO L272 TraceCheckUtils]: 2: Hoare triple {11406#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {11459#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:49,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {11459#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11406#true} is VALID [2022-04-27 15:02:49,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {11406#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11459#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:49,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {11459#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11406#true} is VALID [2022-04-27 15:02:49,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,878 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11406#true} {11406#true} #440#return; {11406#true} is VALID [2022-04-27 15:02:49,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {11406#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11406#true} is VALID [2022-04-27 15:02:49,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,878 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11406#true} {11406#true} #450#return; {11406#true} is VALID [2022-04-27 15:02:49,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {11406#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {11406#true} is VALID [2022-04-27 15:02:49,878 INFO L272 TraceCheckUtils]: 12: Hoare triple {11406#true} call stubMoreProcessingRequired(); {11463#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:49,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {11463#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11406#true} is VALID [2022-04-27 15:02:49,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,879 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11406#true} {11406#true} #452#return; {11406#true} is VALID [2022-04-27 15:02:49,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {11406#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {11406#true} is VALID [2022-04-27 15:02:49,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {11406#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {11406#true} is VALID [2022-04-27 15:02:49,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {11406#true} assume !(1 == ~tmp_ndt_3~0); {11406#true} is VALID [2022-04-27 15:02:49,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {11406#true} ~returnVal2~0 := 259; {11406#true} is VALID [2022-04-27 15:02:49,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {11406#true} assume !(~s~0 == ~NP~0); {11406#true} is VALID [2022-04-27 15:02:49,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {11406#true} assume ~s~0 == ~MPR1~0; {11406#true} is VALID [2022-04-27 15:02:49,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {11406#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {11406#true} is VALID [2022-04-27 15:02:49,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {11406#true} #res := ~returnVal2~0; {11406#true} is VALID [2022-04-27 15:02:49,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,880 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11406#true} {11414#(<= (+ ~myStatus~0 1073741637) 0)} #470#return; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {11406#true} call ULTIMATE.init(); {11444#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:49,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {11444#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {11406#true} is VALID [2022-04-27 15:02:49,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11406#true} {11406#true} #462#return; {11406#true} is VALID [2022-04-27 15:02:49,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {11406#true} call #t~ret35 := main(); {11406#true} is VALID [2022-04-27 15:02:49,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {11406#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {11406#true} is VALID [2022-04-27 15:02:49,882 INFO L272 TraceCheckUtils]: 6: Hoare triple {11406#true} call _BLAST_init(); {11445#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:49,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {11445#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {11406#true} is VALID [2022-04-27 15:02:49,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,882 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {11406#true} {11406#true} #442#return; {11406#true} is VALID [2022-04-27 15:02:49,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {11406#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {11406#true} is VALID [2022-04-27 15:02:49,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {11406#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,883 INFO L272 TraceCheckUtils]: 12: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} call stub_driver_init(); {11446#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:49,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {11446#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {11406#true} is VALID [2022-04-27 15:02:49,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,884 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11406#true} {11414#(<= (+ ~myStatus~0 1073741637) 0)} #444#return; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,884 INFO L290 TraceCheckUtils]: 17: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} assume 3 == ~tmp_ndt_1~0; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,885 INFO L272 TraceCheckUtils]: 19: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} assume 0 == ~irpStack__MinorFunction~0; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} assume !(~s~0 != ~NP~0); {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,888 INFO L272 TraceCheckUtils]: 26: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {11447#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:49,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {11447#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {11406#true} is VALID [2022-04-27 15:02:49,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {11406#true} assume 0 != ~compRegistered~0; {11406#true} is VALID [2022-04-27 15:02:49,888 INFO L272 TraceCheckUtils]: 29: Hoare triple {11406#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {11459#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:49,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {11459#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {11406#true} is VALID [2022-04-27 15:02:49,889 INFO L272 TraceCheckUtils]: 31: Hoare triple {11406#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {11459#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:49,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {11459#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {11406#true} is VALID [2022-04-27 15:02:49,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,889 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11406#true} {11406#true} #440#return; {11406#true} is VALID [2022-04-27 15:02:49,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {11406#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {11406#true} is VALID [2022-04-27 15:02:49,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,889 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {11406#true} {11406#true} #450#return; {11406#true} is VALID [2022-04-27 15:02:49,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {11406#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {11406#true} is VALID [2022-04-27 15:02:49,890 INFO L272 TraceCheckUtils]: 39: Hoare triple {11406#true} call stubMoreProcessingRequired(); {11463#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:49,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {11463#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {11406#true} is VALID [2022-04-27 15:02:49,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,890 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {11406#true} {11406#true} #452#return; {11406#true} is VALID [2022-04-27 15:02:49,890 INFO L290 TraceCheckUtils]: 43: Hoare triple {11406#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {11406#true} is VALID [2022-04-27 15:02:49,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {11406#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {11406#true} is VALID [2022-04-27 15:02:49,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {11406#true} assume !(1 == ~tmp_ndt_3~0); {11406#true} is VALID [2022-04-27 15:02:49,890 INFO L290 TraceCheckUtils]: 46: Hoare triple {11406#true} ~returnVal2~0 := 259; {11406#true} is VALID [2022-04-27 15:02:49,890 INFO L290 TraceCheckUtils]: 47: Hoare triple {11406#true} assume !(~s~0 == ~NP~0); {11406#true} is VALID [2022-04-27 15:02:49,890 INFO L290 TraceCheckUtils]: 48: Hoare triple {11406#true} assume ~s~0 == ~MPR1~0; {11406#true} is VALID [2022-04-27 15:02:49,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {11406#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {11406#true} is VALID [2022-04-27 15:02:49,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {11406#true} #res := ~returnVal2~0; {11406#true} is VALID [2022-04-27 15:02:49,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {11406#true} assume true; {11406#true} is VALID [2022-04-27 15:02:49,891 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11406#true} {11414#(<= (+ ~myStatus~0 1073741637) 0)} #470#return; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} assume !(259 == ~__cil_tmp23~0); {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,892 INFO L290 TraceCheckUtils]: 55: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} assume ~status~0 >= 0; {11414#(<= (+ ~myStatus~0 1073741637) 0)} is VALID [2022-04-27 15:02:49,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {11414#(<= (+ ~myStatus~0 1073741637) 0)} assume ~myStatus~0 >= 0;~devExt__Started~0 := 1;~devExt__Removed~0 := 0;~devExt__SurpriseRemoved~0 := 0; {11407#false} is VALID [2022-04-27 15:02:49,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {11407#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {11407#false} is VALID [2022-04-27 15:02:49,892 INFO L272 TraceCheckUtils]: 58: Hoare triple {11407#false} call IofCompleteRequest(~Irp, 0); {11407#false} is VALID [2022-04-27 15:02:49,892 INFO L290 TraceCheckUtils]: 59: Hoare triple {11407#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {11407#false} is VALID [2022-04-27 15:02:49,892 INFO L290 TraceCheckUtils]: 60: Hoare triple {11407#false} assume !(~s~0 == ~NP~0); {11407#false} is VALID [2022-04-27 15:02:49,892 INFO L272 TraceCheckUtils]: 61: Hoare triple {11407#false} call errorFn(); {11407#false} is VALID [2022-04-27 15:02:49,893 INFO L290 TraceCheckUtils]: 62: Hoare triple {11407#false} assume !false; {11407#false} is VALID [2022-04-27 15:02:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:49,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:49,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034059359] [2022-04-27 15:02:49,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034059359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:49,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:49,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 15:02:49,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892834855] [2022-04-27 15:02:49,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:49,894 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-04-27 15:02:49,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:49,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:49,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:49,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 15:02:49,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:49,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 15:02:49,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-27 15:02:49,933 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:50,484 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-04-27 15:02:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 15:02:50,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2022-04-27 15:02:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2022-04-27 15:02:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2022-04-27 15:02:50,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 146 transitions. [2022-04-27 15:02:50,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:50,626 INFO L225 Difference]: With dead ends: 141 [2022-04-27 15:02:50,626 INFO L226 Difference]: Without dead ends: 134 [2022-04-27 15:02:50,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-27 15:02:50,628 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 85 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:50,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 186 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 15:02:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-27 15:02:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2022-04-27 15:02:50,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:50,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 15:02:50,660 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 15:02:50,660 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 15:02:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:50,662 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-27 15:02:50,662 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2022-04-27 15:02:50,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:50,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:50,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 134 states. [2022-04-27 15:02:50,663 INFO L87 Difference]: Start difference. First operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 134 states. [2022-04-27 15:02:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:50,664 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-27 15:02:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2022-04-27 15:02:50,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:50,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:50,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:50,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0606060606060606) internal successors, (105), 99 states have internal predecessors, (105), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 15:02:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2022-04-27 15:02:50,667 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2022-04-27 15:02:50,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:50,667 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2022-04-27 15:02:50,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (11), 9 states have call predecessors, (11), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-27 15:02:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2022-04-27 15:02:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 15:02:50,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:50,668 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:50,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:02:50,668 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:50,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:50,668 INFO L85 PathProgramCache]: Analyzing trace with hash -577905048, now seen corresponding path program 1 times [2022-04-27 15:02:50,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:50,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174776697] [2022-04-27 15:02:50,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:50,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:50,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {12160#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {12121#true} is VALID [2022-04-27 15:02:50,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12121#true} {12121#true} #462#return; {12121#true} is VALID [2022-04-27 15:02:50,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:50,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {12161#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {12121#true} is VALID [2022-04-27 15:02:50,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,781 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12121#true} {12121#true} #442#return; {12121#true} is VALID [2022-04-27 15:02:50,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:50,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {12162#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {12121#true} is VALID [2022-04-27 15:02:50,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,793 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12121#true} {12121#true} #444#return; {12121#true} is VALID [2022-04-27 15:02:50,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 15:02:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:50,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 15:02:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:50,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 15:02:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:50,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {12177#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12121#true} is VALID [2022-04-27 15:02:50,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12121#true} {12121#true} #440#return; {12121#true} is VALID [2022-04-27 15:02:50,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {12177#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {12121#true} is VALID [2022-04-27 15:02:50,870 INFO L272 TraceCheckUtils]: 1: Hoare triple {12121#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {12177#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:50,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {12177#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12121#true} is VALID [2022-04-27 15:02:50,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,870 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12121#true} {12121#true} #440#return; {12121#true} is VALID [2022-04-27 15:02:50,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {12121#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {12121#true} is VALID [2022-04-27 15:02:50,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,870 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12121#true} {12121#true} #450#return; {12121#true} is VALID [2022-04-27 15:02:50,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:50,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {12181#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {12121#true} is VALID [2022-04-27 15:02:50,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12121#true} {12121#true} #452#return; {12121#true} is VALID [2022-04-27 15:02:50,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {12163#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {12121#true} is VALID [2022-04-27 15:02:50,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {12121#true} assume 0 != ~compRegistered~0; {12121#true} is VALID [2022-04-27 15:02:50,879 INFO L272 TraceCheckUtils]: 2: Hoare triple {12121#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {12177#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:50,879 INFO L290 TraceCheckUtils]: 3: Hoare triple {12177#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {12121#true} is VALID [2022-04-27 15:02:50,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {12121#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {12177#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:50,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {12177#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12121#true} is VALID [2022-04-27 15:02:50,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,880 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12121#true} {12121#true} #440#return; {12121#true} is VALID [2022-04-27 15:02:50,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {12121#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {12121#true} is VALID [2022-04-27 15:02:50,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,880 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12121#true} {12121#true} #450#return; {12121#true} is VALID [2022-04-27 15:02:50,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {12121#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {12121#true} is VALID [2022-04-27 15:02:50,880 INFO L272 TraceCheckUtils]: 12: Hoare triple {12121#true} call stubMoreProcessingRequired(); {12181#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:50,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {12181#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {12121#true} is VALID [2022-04-27 15:02:50,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,880 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12121#true} {12121#true} #452#return; {12121#true} is VALID [2022-04-27 15:02:50,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {12121#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {12121#true} is VALID [2022-04-27 15:02:50,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {12121#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {12121#true} is VALID [2022-04-27 15:02:50,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {12121#true} assume !(1 == ~tmp_ndt_3~0); {12121#true} is VALID [2022-04-27 15:02:50,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {12121#true} ~returnVal2~0 := 259; {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-27 15:02:50,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-27 15:02:50,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-27 15:02:50,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-27 15:02:50,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {12176#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-27 15:02:50,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {12176#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} assume true; {12176#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-27 15:02:50,883 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12176#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} {12121#true} #470#return; {12158#(and (<= |KbFilter_PnP_#t~ret12| 259) (<= 259 |KbFilter_PnP_#t~ret12|))} is VALID [2022-04-27 15:02:50,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {12121#true} call ULTIMATE.init(); {12160#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:50,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {12160#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {12121#true} is VALID [2022-04-27 15:02:50,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12121#true} {12121#true} #462#return; {12121#true} is VALID [2022-04-27 15:02:50,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {12121#true} call #t~ret35 := main(); {12121#true} is VALID [2022-04-27 15:02:50,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {12121#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {12121#true} is VALID [2022-04-27 15:02:50,885 INFO L272 TraceCheckUtils]: 6: Hoare triple {12121#true} call _BLAST_init(); {12161#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:50,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {12161#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {12121#true} is VALID [2022-04-27 15:02:50,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,885 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {12121#true} {12121#true} #442#return; {12121#true} is VALID [2022-04-27 15:02:50,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {12121#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {12121#true} is VALID [2022-04-27 15:02:50,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {12121#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {12121#true} is VALID [2022-04-27 15:02:50,885 INFO L272 TraceCheckUtils]: 12: Hoare triple {12121#true} call stub_driver_init(); {12162#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:50,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {12162#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {12121#true} is VALID [2022-04-27 15:02:50,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,886 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12121#true} {12121#true} #444#return; {12121#true} is VALID [2022-04-27 15:02:50,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {12121#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {12121#true} is VALID [2022-04-27 15:02:50,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {12121#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {12121#true} is VALID [2022-04-27 15:02:50,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {12121#true} assume 3 == ~tmp_ndt_1~0; {12121#true} is VALID [2022-04-27 15:02:50,886 INFO L272 TraceCheckUtils]: 19: Hoare triple {12121#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {12121#true} is VALID [2022-04-27 15:02:50,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {12121#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {12121#true} is VALID [2022-04-27 15:02:50,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {12121#true} assume 0 == ~irpStack__MinorFunction~0; {12121#true} is VALID [2022-04-27 15:02:50,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {12121#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {12121#true} is VALID [2022-04-27 15:02:50,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {12121#true} assume !(~s~0 != ~NP~0); {12121#true} is VALID [2022-04-27 15:02:50,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {12121#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {12121#true} is VALID [2022-04-27 15:02:50,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {12121#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {12121#true} is VALID [2022-04-27 15:02:50,887 INFO L272 TraceCheckUtils]: 26: Hoare triple {12121#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {12163#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:50,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {12163#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {12121#true} is VALID [2022-04-27 15:02:50,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {12121#true} assume 0 != ~compRegistered~0; {12121#true} is VALID [2022-04-27 15:02:50,887 INFO L272 TraceCheckUtils]: 29: Hoare triple {12121#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {12177#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:50,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {12177#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {12121#true} is VALID [2022-04-27 15:02:50,888 INFO L272 TraceCheckUtils]: 31: Hoare triple {12121#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {12177#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:50,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {12177#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12121#true} is VALID [2022-04-27 15:02:50,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,888 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12121#true} {12121#true} #440#return; {12121#true} is VALID [2022-04-27 15:02:50,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {12121#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {12121#true} is VALID [2022-04-27 15:02:50,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,888 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12121#true} {12121#true} #450#return; {12121#true} is VALID [2022-04-27 15:02:50,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {12121#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {12121#true} is VALID [2022-04-27 15:02:50,888 INFO L272 TraceCheckUtils]: 39: Hoare triple {12121#true} call stubMoreProcessingRequired(); {12181#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:50,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {12181#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {12121#true} is VALID [2022-04-27 15:02:50,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {12121#true} assume true; {12121#true} is VALID [2022-04-27 15:02:50,888 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12121#true} {12121#true} #452#return; {12121#true} is VALID [2022-04-27 15:02:50,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {12121#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {12121#true} is VALID [2022-04-27 15:02:50,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {12121#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {12121#true} is VALID [2022-04-27 15:02:50,889 INFO L290 TraceCheckUtils]: 45: Hoare triple {12121#true} assume !(1 == ~tmp_ndt_3~0); {12121#true} is VALID [2022-04-27 15:02:50,889 INFO L290 TraceCheckUtils]: 46: Hoare triple {12121#true} ~returnVal2~0 := 259; {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-27 15:02:50,889 INFO L290 TraceCheckUtils]: 47: Hoare triple {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-27 15:02:50,889 INFO L290 TraceCheckUtils]: 48: Hoare triple {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-27 15:02:50,890 INFO L290 TraceCheckUtils]: 49: Hoare triple {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-27 15:02:50,890 INFO L290 TraceCheckUtils]: 50: Hoare triple {12175#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {12176#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-27 15:02:50,890 INFO L290 TraceCheckUtils]: 51: Hoare triple {12176#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} assume true; {12176#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-27 15:02:50,891 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12176#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} {12121#true} #470#return; {12158#(and (<= |KbFilter_PnP_#t~ret12| 259) (<= 259 |KbFilter_PnP_#t~ret12|))} is VALID [2022-04-27 15:02:50,891 INFO L290 TraceCheckUtils]: 53: Hoare triple {12158#(and (<= |KbFilter_PnP_#t~ret12| 259) (<= 259 |KbFilter_PnP_#t~ret12|))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {12159#(and (< 258 KbFilter_PnP_~__cil_tmp23~0) (<= KbFilter_PnP_~__cil_tmp23~0 259))} is VALID [2022-04-27 15:02:50,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {12159#(and (< 258 KbFilter_PnP_~__cil_tmp23~0) (<= KbFilter_PnP_~__cil_tmp23~0 259))} assume !(259 == ~__cil_tmp23~0); {12122#false} is VALID [2022-04-27 15:02:50,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {12122#false} assume ~status~0 >= 0; {12122#false} is VALID [2022-04-27 15:02:50,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {12122#false} assume !(~myStatus~0 >= 0); {12122#false} is VALID [2022-04-27 15:02:50,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {12122#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {12122#false} is VALID [2022-04-27 15:02:50,892 INFO L272 TraceCheckUtils]: 58: Hoare triple {12122#false} call IofCompleteRequest(~Irp, 0); {12122#false} is VALID [2022-04-27 15:02:50,892 INFO L290 TraceCheckUtils]: 59: Hoare triple {12122#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {12122#false} is VALID [2022-04-27 15:02:50,892 INFO L290 TraceCheckUtils]: 60: Hoare triple {12122#false} assume !(~s~0 == ~NP~0); {12122#false} is VALID [2022-04-27 15:02:50,892 INFO L272 TraceCheckUtils]: 61: Hoare triple {12122#false} call errorFn(); {12122#false} is VALID [2022-04-27 15:02:50,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {12122#false} assume !false; {12122#false} is VALID [2022-04-27 15:02:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:50,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:50,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174776697] [2022-04-27 15:02:50,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174776697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:50,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:50,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-27 15:02:50,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778316104] [2022-04-27 15:02:50,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-04-27 15:02:50,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:50,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:50,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:50,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 15:02:50,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:50,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 15:02:50,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-27 15:02:50,927 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:51,606 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2022-04-27 15:02:51,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 15:02:51,607 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-04-27 15:02:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-04-27 15:02:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 88 transitions. [2022-04-27 15:02:51,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 88 transitions. [2022-04-27 15:02:51,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:51,681 INFO L225 Difference]: With dead ends: 144 [2022-04-27 15:02:51,681 INFO L226 Difference]: Without dead ends: 133 [2022-04-27 15:02:51,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-27 15:02:51,682 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 97 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:51,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 244 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 15:02:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-27 15:02:51,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-04-27 15:02:51,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:51,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 15:02:51,722 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 15:02:51,722 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 15:02:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:51,723 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-27 15:02:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-27 15:02:51,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:51,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:51,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 133 states. [2022-04-27 15:02:51,740 INFO L87 Difference]: Start difference. First operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 133 states. [2022-04-27 15:02:51,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:51,742 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-27 15:02:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-27 15:02:51,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:51,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:51,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:51,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.0404040404040404) internal successors, (103), 99 states have internal predecessors, (103), 19 states have call successors, (19), 19 states have call predecessors, (19), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 15:02:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2022-04-27 15:02:51,745 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2022-04-27 15:02:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:51,745 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2022-04-27 15:02:51,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-27 15:02:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2022-04-27 15:02:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-27 15:02:51,746 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:02:51,746 INFO L195 NwaCegarLoop]: 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] [2022-04-27 15:02:51,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:02:51,746 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:02:51,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:02:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1364815011, now seen corresponding path program 1 times [2022-04-27 15:02:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:02:51,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456122668] [2022-04-27 15:02:51,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:02:51,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:02:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:51,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:02:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:51,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {12880#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {12833#true} is VALID [2022-04-27 15:02:51,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12833#true} {12833#true} #462#return; {12833#true} is VALID [2022-04-27 15:02:51,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 15:02:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:51,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {12881#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {12833#true} is VALID [2022-04-27 15:02:51,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12833#true} {12833#true} #442#return; {12833#true} is VALID [2022-04-27 15:02:51,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:51,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {12882#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {12833#true} is VALID [2022-04-27 15:02:51,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,866 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12833#true} {12833#true} #444#return; {12833#true} is VALID [2022-04-27 15:02:51,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-27 15:02:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:51,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-27 15:02:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:51,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 15:02:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:51,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {12895#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12833#true} is VALID [2022-04-27 15:02:51,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12833#true} {12833#true} #440#return; {12833#true} is VALID [2022-04-27 15:02:51,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {12895#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {12833#true} is VALID [2022-04-27 15:02:51,893 INFO L272 TraceCheckUtils]: 1: Hoare triple {12833#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {12895#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:51,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {12895#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12833#true} is VALID [2022-04-27 15:02:51,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,893 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12833#true} {12833#true} #440#return; {12833#true} is VALID [2022-04-27 15:02:51,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {12833#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {12833#true} is VALID [2022-04-27 15:02:51,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,893 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12833#true} {12833#true} #450#return; {12833#true} is VALID [2022-04-27 15:02:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:02:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:51,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {12899#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {12833#true} is VALID [2022-04-27 15:02:51,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12833#true} {12833#true} #452#return; {12833#true} is VALID [2022-04-27 15:02:51,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {12883#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {12833#true} is VALID [2022-04-27 15:02:51,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {12833#true} assume 0 != ~compRegistered~0; {12833#true} is VALID [2022-04-27 15:02:51,902 INFO L272 TraceCheckUtils]: 2: Hoare triple {12833#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {12895#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:51,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {12895#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {12833#true} is VALID [2022-04-27 15:02:51,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {12833#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {12895#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:51,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {12895#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12833#true} is VALID [2022-04-27 15:02:51,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,903 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12833#true} {12833#true} #440#return; {12833#true} is VALID [2022-04-27 15:02:51,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {12833#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {12833#true} is VALID [2022-04-27 15:02:51,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,903 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12833#true} {12833#true} #450#return; {12833#true} is VALID [2022-04-27 15:02:51,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {12833#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {12833#true} is VALID [2022-04-27 15:02:51,903 INFO L272 TraceCheckUtils]: 12: Hoare triple {12833#true} call stubMoreProcessingRequired(); {12899#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:51,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {12899#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {12833#true} is VALID [2022-04-27 15:02:51,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,903 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12833#true} {12833#true} #452#return; {12833#true} is VALID [2022-04-27 15:02:51,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {12833#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {12833#true} is VALID [2022-04-27 15:02:51,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {12833#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {12833#true} is VALID [2022-04-27 15:02:51,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {12833#true} assume !(1 == ~tmp_ndt_3~0); {12833#true} is VALID [2022-04-27 15:02:51,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {12833#true} ~returnVal2~0 := 259; {12833#true} is VALID [2022-04-27 15:02:51,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {12833#true} assume !(~s~0 == ~NP~0); {12833#true} is VALID [2022-04-27 15:02:51,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {12833#true} assume ~s~0 == ~MPR1~0; {12833#true} is VALID [2022-04-27 15:02:51,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {12833#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {12870#(= ~MPR3~0 ~s~0)} is VALID [2022-04-27 15:02:51,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {12870#(= ~MPR3~0 ~s~0)} #res := ~returnVal2~0; {12870#(= ~MPR3~0 ~s~0)} is VALID [2022-04-27 15:02:51,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {12870#(= ~MPR3~0 ~s~0)} assume true; {12870#(= ~MPR3~0 ~s~0)} is VALID [2022-04-27 15:02:51,905 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12870#(= ~MPR3~0 ~s~0)} {12833#true} #470#return; {12870#(= ~MPR3~0 ~s~0)} is VALID [2022-04-27 15:02:51,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-27 15:02:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:02:51,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {12900#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {12899#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:51,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {12899#(= ~s~0 |old(~s~0)|)} assume !(~s~0 == ~MPR3~0); {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {12901#(not (= ~MPR3~0 |old(~s~0)|))} assume !(1 == ~customIrp~0); {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {12901#(not (= ~MPR3~0 |old(~s~0)|))} assume !(~s~0 == ~MPR3~0); {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {12901#(not (= ~MPR3~0 |old(~s~0)|))} havoc ~tmp_ndt_4~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp_ndt_4~0 := #t~nondet33;havoc #t~nondet33; {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {12901#(not (= ~MPR3~0 |old(~s~0)|))} assume 0 == ~tmp_ndt_4~0; {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {12901#(not (= ~MPR3~0 |old(~s~0)|))} #res := 0; {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {12901#(not (= ~MPR3~0 |old(~s~0)|))} assume true; {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,928 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12901#(not (= ~MPR3~0 |old(~s~0)|))} {12870#(= ~MPR3~0 ~s~0)} #472#return; {12834#false} is VALID [2022-04-27 15:02:51,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {12833#true} call ULTIMATE.init(); {12880#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:02:51,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {12880#(and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0; {12833#true} is VALID [2022-04-27 15:02:51,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12833#true} {12833#true} #462#return; {12833#true} is VALID [2022-04-27 15:02:51,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {12833#true} call #t~ret35 := main(); {12833#true} is VALID [2022-04-27 15:02:51,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {12833#true} havoc ~status~1;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~irp~0 := #t~nondet23;havoc #t~nondet23;havoc ~pirp~0;havoc ~pirp__IoStatus__Status~0;assume -2147483648 <= #t~nondet24 && #t~nondet24 <= 2147483647;~irp_choice~0 := #t~nondet24;havoc #t~nondet24;assume -2147483648 <= #t~nondet25 && #t~nondet25 <= 2147483647;~devobj~0 := #t~nondet25;havoc #t~nondet25;havoc ~__cil_tmp8~0;~KernelMode~0 := 0;~Executive~0 := 0;~s~0 := 0;~UNLOADED~0 := 0;~NP~0 := 0;~DC~0 := 0;~SKIP1~0 := 0;~SKIP2~0 := 0;~MPR1~0 := 0;~MPR3~0 := 0;~IPC~0 := 0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0;~myStatus~0 := 0;~status~1 := 0;~pirp~0 := ~irp~0; {12833#true} is VALID [2022-04-27 15:02:51,931 INFO L272 TraceCheckUtils]: 6: Hoare triple {12833#true} call _BLAST_init(); {12881#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {12881#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~UNLOADED~0 := 0;~NP~0 := 1;~DC~0 := 2;~SKIP1~0 := 3;~SKIP2~0 := 4;~MPR1~0 := 5;~MPR3~0 := 6;~IPC~0 := 7;~s~0 := ~UNLOADED~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {12833#true} is VALID [2022-04-27 15:02:51,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,931 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {12833#true} {12833#true} #442#return; {12833#true} is VALID [2022-04-27 15:02:51,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {12833#true} assume ~status~1 >= 0;~s~0 := ~NP~0;~customIrp~0 := 0;~setEventCalled~0 := ~customIrp~0;~lowerDriverReturn~0 := ~setEventCalled~0;~compRegistered~0 := ~lowerDriverReturn~0;~pended~0 := ~compRegistered~0;~pirp__IoStatus__Status~0 := 0;~myStatus~0 := 0; {12833#true} is VALID [2022-04-27 15:02:51,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {12833#true} assume 0 == ~irp_choice~0;~pirp__IoStatus__Status~0 := -1073741637;~myStatus~0 := -1073741637; {12833#true} is VALID [2022-04-27 15:02:51,932 INFO L272 TraceCheckUtils]: 12: Hoare triple {12833#true} call stub_driver_init(); {12882#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {12882#(and (= |old(~compRegistered~0)| ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~s~0 := ~NP~0;~pended~0 := 0;~compFptr~0 := 0;~compRegistered~0 := 0;~lowerDriverReturn~0 := 0;~setEventCalled~0 := 0;~customIrp~0 := 0; {12833#true} is VALID [2022-04-27 15:02:51,932 INFO L290 TraceCheckUtils]: 14: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,932 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12833#true} {12833#true} #444#return; {12833#true} is VALID [2022-04-27 15:02:51,932 INFO L290 TraceCheckUtils]: 16: Hoare triple {12833#true} assume ~status~1 >= 0;~__cil_tmp8~0 := 1; {12833#true} is VALID [2022-04-27 15:02:51,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {12833#true} assume !(0 == ~__cil_tmp8~0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {12833#true} is VALID [2022-04-27 15:02:51,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {12833#true} assume 3 == ~tmp_ndt_1~0; {12833#true} is VALID [2022-04-27 15:02:51,932 INFO L272 TraceCheckUtils]: 19: Hoare triple {12833#true} call #t~ret27 := KbFilter_PnP(~devobj~0, ~pirp~0); {12833#true} is VALID [2022-04-27 15:02:51,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {12833#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~devExt~0;havoc ~irpStack~0;havoc ~status~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~event~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~DeviceObject__DeviceExtension~0 := #t~nondet7;havoc #t~nondet7;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~0 := #t~nondet8;havoc #t~nondet8;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~irpStack__MinorFunction~0 := #t~nondet9;havoc #t~nondet9;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~devExt__TopOfStack~0 := #t~nondet10;havoc #t~nondet10;havoc ~devExt__Started~0;havoc ~devExt__Removed~0;havoc ~devExt__SurpriseRemoved~0;havoc ~Irp__IoStatus__Status~0;havoc ~Irp__IoStatus__Information~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~Irp__CurrentLocation~0 := #t~nondet11;havoc #t~nondet11;havoc ~irpSp~0;havoc ~nextIrpSp~0;havoc ~nextIrpSp__Control~0;havoc ~irpSp___0~0;havoc ~irpSp__Context~0;havoc ~irpSp__Control~0;havoc ~__cil_tmp23~0;~status~0 := 0;~devExt~0 := ~DeviceObject__DeviceExtension~0;~irpStack~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0; {12833#true} is VALID [2022-04-27 15:02:51,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {12833#true} assume 0 == ~irpStack__MinorFunction~0; {12833#true} is VALID [2022-04-27 15:02:51,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {12833#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {12833#true} is VALID [2022-04-27 15:02:51,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {12833#true} assume !(~s~0 != ~NP~0); {12833#true} is VALID [2022-04-27 15:02:51,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {12833#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {12833#true} is VALID [2022-04-27 15:02:51,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {12833#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Control~0 := 224; {12833#true} is VALID [2022-04-27 15:02:51,933 INFO L272 TraceCheckUtils]: 26: Hoare triple {12833#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {12883#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {12883#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~lcontext~0 := #t~nondet28;havoc #t~nondet28;havoc ~__cil_tmp7~0; {12833#true} is VALID [2022-04-27 15:02:51,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {12833#true} assume 0 != ~compRegistered~0; {12833#true} is VALID [2022-04-27 15:02:51,934 INFO L272 TraceCheckUtils]: 29: Hoare triple {12833#true} call #t~ret29 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {12895#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:51,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {12895#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {12833#true} is VALID [2022-04-27 15:02:51,934 INFO L272 TraceCheckUtils]: 31: Hoare triple {12833#true} call #t~ret34 := KeSetEvent(~event~1, 0, 0); {12895#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-27 15:02:51,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {12895#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet32 && #t~nondet32 <= 2147483647;~l~0 := #t~nondet32;havoc #t~nondet32;~setEventCalled~0 := 1;#res := ~l~0; {12833#true} is VALID [2022-04-27 15:02:51,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,935 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12833#true} {12833#true} #440#return; {12833#true} is VALID [2022-04-27 15:02:51,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {12833#true} assume -2147483648 <= #t~ret34 && #t~ret34 <= 2147483647;havoc #t~ret34;#res := -1073741802; {12833#true} is VALID [2022-04-27 15:02:51,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,935 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {12833#true} {12833#true} #450#return; {12833#true} is VALID [2022-04-27 15:02:51,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {12833#true} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~compRetStatus~0 := #t~ret29;havoc #t~ret29; {12833#true} is VALID [2022-04-27 15:02:51,935 INFO L272 TraceCheckUtils]: 39: Hoare triple {12833#true} call stubMoreProcessingRequired(); {12899#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:51,935 INFO L290 TraceCheckUtils]: 40: Hoare triple {12899#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {12833#true} is VALID [2022-04-27 15:02:51,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {12833#true} assume true; {12833#true} is VALID [2022-04-27 15:02:51,935 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {12833#true} {12833#true} #452#return; {12833#true} is VALID [2022-04-27 15:02:51,935 INFO L290 TraceCheckUtils]: 43: Hoare triple {12833#true} havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_2~0 := #t~nondet30;havoc #t~nondet30; {12833#true} is VALID [2022-04-27 15:02:51,935 INFO L290 TraceCheckUtils]: 44: Hoare triple {12833#true} assume !(0 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647;~tmp_ndt_3~0 := #t~nondet31;havoc #t~nondet31; {12833#true} is VALID [2022-04-27 15:02:51,935 INFO L290 TraceCheckUtils]: 45: Hoare triple {12833#true} assume !(1 == ~tmp_ndt_3~0); {12833#true} is VALID [2022-04-27 15:02:51,935 INFO L290 TraceCheckUtils]: 46: Hoare triple {12833#true} ~returnVal2~0 := 259; {12833#true} is VALID [2022-04-27 15:02:51,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {12833#true} assume !(~s~0 == ~NP~0); {12833#true} is VALID [2022-04-27 15:02:51,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {12833#true} assume ~s~0 == ~MPR1~0; {12833#true} is VALID [2022-04-27 15:02:51,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {12833#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {12870#(= ~MPR3~0 ~s~0)} is VALID [2022-04-27 15:02:51,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {12870#(= ~MPR3~0 ~s~0)} #res := ~returnVal2~0; {12870#(= ~MPR3~0 ~s~0)} is VALID [2022-04-27 15:02:51,936 INFO L290 TraceCheckUtils]: 51: Hoare triple {12870#(= ~MPR3~0 ~s~0)} assume true; {12870#(= ~MPR3~0 ~s~0)} is VALID [2022-04-27 15:02:51,937 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {12870#(= ~MPR3~0 ~s~0)} {12833#true} #470#return; {12870#(= ~MPR3~0 ~s~0)} is VALID [2022-04-27 15:02:51,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {12870#(= ~MPR3~0 ~s~0)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {12870#(= ~MPR3~0 ~s~0)} is VALID [2022-04-27 15:02:51,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {12870#(= ~MPR3~0 ~s~0)} assume 259 == ~__cil_tmp23~0; {12870#(= ~MPR3~0 ~s~0)} is VALID [2022-04-27 15:02:51,938 INFO L272 TraceCheckUtils]: 55: Hoare triple {12870#(= ~MPR3~0 ~s~0)} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {12900#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,938 INFO L290 TraceCheckUtils]: 56: Hoare triple {12900#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {12899#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-27 15:02:51,939 INFO L290 TraceCheckUtils]: 57: Hoare triple {12899#(= ~s~0 |old(~s~0)|)} assume !(~s~0 == ~MPR3~0); {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,939 INFO L290 TraceCheckUtils]: 58: Hoare triple {12901#(not (= ~MPR3~0 |old(~s~0)|))} assume !(1 == ~customIrp~0); {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,939 INFO L290 TraceCheckUtils]: 59: Hoare triple {12901#(not (= ~MPR3~0 |old(~s~0)|))} assume !(~s~0 == ~MPR3~0); {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,939 INFO L290 TraceCheckUtils]: 60: Hoare triple {12901#(not (= ~MPR3~0 |old(~s~0)|))} havoc ~tmp_ndt_4~0;assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647;~tmp_ndt_4~0 := #t~nondet33;havoc #t~nondet33; {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,940 INFO L290 TraceCheckUtils]: 61: Hoare triple {12901#(not (= ~MPR3~0 |old(~s~0)|))} assume 0 == ~tmp_ndt_4~0; {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {12901#(not (= ~MPR3~0 |old(~s~0)|))} #res := 0; {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,940 INFO L290 TraceCheckUtils]: 63: Hoare triple {12901#(not (= ~MPR3~0 |old(~s~0)|))} assume true; {12901#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-27 15:02:51,941 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12901#(not (= ~MPR3~0 |old(~s~0)|))} {12870#(= ~MPR3~0 ~s~0)} #472#return; {12834#false} is VALID [2022-04-27 15:02:51,941 INFO L290 TraceCheckUtils]: 65: Hoare triple {12834#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;havoc #t~ret13; {12834#false} is VALID [2022-04-27 15:02:51,941 INFO L290 TraceCheckUtils]: 66: Hoare triple {12834#false} assume ~status~0 >= 0; {12834#false} is VALID [2022-04-27 15:02:51,941 INFO L290 TraceCheckUtils]: 67: Hoare triple {12834#false} assume !(~myStatus~0 >= 0); {12834#false} is VALID [2022-04-27 15:02:51,941 INFO L290 TraceCheckUtils]: 68: Hoare triple {12834#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {12834#false} is VALID [2022-04-27 15:02:51,941 INFO L272 TraceCheckUtils]: 69: Hoare triple {12834#false} call IofCompleteRequest(~Irp, 0); {12834#false} is VALID [2022-04-27 15:02:51,941 INFO L290 TraceCheckUtils]: 70: Hoare triple {12834#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {12834#false} is VALID [2022-04-27 15:02:51,941 INFO L290 TraceCheckUtils]: 71: Hoare triple {12834#false} assume !(~s~0 == ~NP~0); {12834#false} is VALID [2022-04-27 15:02:51,941 INFO L272 TraceCheckUtils]: 72: Hoare triple {12834#false} call errorFn(); {12834#false} is VALID [2022-04-27 15:02:51,942 INFO L290 TraceCheckUtils]: 73: Hoare triple {12834#false} assume !false; {12834#false} is VALID [2022-04-27 15:02:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:02:51,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:02:51,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456122668] [2022-04-27 15:02:51,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456122668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:02:51,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:02:51,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-27 15:02:51,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54794157] [2022-04-27 15:02:51,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:02:51,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2022-04-27 15:02:51,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:02:51,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 15:02:51,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:51,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 15:02:51,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:02:51,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 15:02:51,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-27 15:02:51,989 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 15:02:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:52,362 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2022-04-27 15:02:52,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:02:52,362 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2022-04-27 15:02:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:02:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 15:02:52,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-27 15:02:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 15:02:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-27 15:02:52,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2022-04-27 15:02:52,424 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:02:52,424 INFO L225 Difference]: With dead ends: 133 [2022-04-27 15:02:52,424 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:02:52,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-04-27 15:02:52,425 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 55 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:02:52,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 133 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:02:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:02:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:02:52,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:02:52,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-27 15:02:52,426 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-27 15:02:52,426 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-27 15:02:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:52,426 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:02:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:02:52,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:52,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:52,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) Second operand 0 states. [2022-04-27 15:02:52,426 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) Second operand 0 states. [2022-04-27 15:02:52,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:02:52,426 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:02:52,426 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:02:52,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:52,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:02:52,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:02:52,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:02:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-04-27 15:02:52,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:02:52,427 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-04-27 15:02:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:02:52,427 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:02:52,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 15:02:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:02:52,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:02:52,429 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:02:52,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:02:52,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 15:02:54,543 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 15:02:54,543 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 15:02:54,543 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 15:02:54,543 INFO L895 garLoopResultBuilder]: At program point KeSetEventENTRY(lines 515 522) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-27 15:02:54,543 INFO L899 garLoopResultBuilder]: For program point KeSetEventFINAL(lines 515 522) no Hoare annotation was computed. [2022-04-27 15:02:54,543 INFO L899 garLoopResultBuilder]: For program point KeSetEventEXIT(lines 515 522) no Hoare annotation was computed. [2022-04-27 15:02:54,543 INFO L895 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 565 575) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-27 15:02:54,543 INFO L895 garLoopResultBuilder]: At program point L571(line 571) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-27 15:02:54,543 INFO L899 garLoopResultBuilder]: For program point L571-1(line 571) no Hoare annotation was computed. [2022-04-27 15:02:54,544 INFO L899 garLoopResultBuilder]: For program point KbFilter_CompleteFINAL(lines 565 575) no Hoare annotation was computed. [2022-04-27 15:02:54,544 INFO L899 garLoopResultBuilder]: For program point KbFilter_CompleteEXIT(lines 565 575) no Hoare annotation was computed. [2022-04-27 15:02:54,544 INFO L899 garLoopResultBuilder]: For program point stub_driver_initEXIT(lines 37 50) no Hoare annotation was computed. [2022-04-27 15:02:54,544 INFO L895 garLoopResultBuilder]: At program point stub_driver_initENTRY(lines 37 50) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~compFptr~0 |old(~compFptr~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~pended~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= |old(~pended~0)| 0))) [2022-04-27 15:02:54,544 INFO L899 garLoopResultBuilder]: For program point stub_driver_initFINAL(lines 37 50) no Hoare annotation was computed. [2022-04-27 15:02:54,544 INFO L899 garLoopResultBuilder]: For program point _BLAST_initFINAL(lines 51 72) no Hoare annotation was computed. [2022-04-27 15:02:54,544 INFO L895 garLoopResultBuilder]: At program point _BLAST_initENTRY(lines 51 72) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (and (= ~DC~0 |old(~DC~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~NP~0 |old(~s~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-27 15:02:54,544 INFO L899 garLoopResultBuilder]: For program point _BLAST_initEXIT(lines 51 72) no Hoare annotation was computed. [2022-04-27 15:02:54,544 INFO L902 garLoopResultBuilder]: At program point errorFnENTRY(lines 577 584) the Hoare annotation is: true [2022-04-27 15:02:54,544 INFO L899 garLoopResultBuilder]: For program point errorFnFINAL(lines 577 584) no Hoare annotation was computed. [2022-04-27 15:02:54,544 INFO L899 garLoopResultBuilder]: For program point errorFnEXIT(lines 577 584) no Hoare annotation was computed. [2022-04-27 15:02:54,544 INFO L899 garLoopResultBuilder]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 581) no Hoare annotation was computed. [2022-04-27 15:02:54,544 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 288 422) no Hoare annotation was computed. [2022-04-27 15:02:54,544 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-27 15:02:54,544 INFO L899 garLoopResultBuilder]: For program point L359(line 359) no Hoare annotation was computed. [2022-04-27 15:02:54,545 INFO L895 garLoopResultBuilder]: At program point L384(lines 377 417) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-27 15:02:54,545 INFO L899 garLoopResultBuilder]: For program point L409(lines 409 411) no Hoare annotation was computed. [2022-04-27 15:02:54,545 INFO L895 garLoopResultBuilder]: At program point L376(lines 369 418) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-27 15:02:54,545 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 288 422) no Hoare annotation was computed. [2022-04-27 15:02:54,545 INFO L899 garLoopResultBuilder]: For program point L385(lines 369 418) no Hoare annotation was computed. [2022-04-27 15:02:54,545 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 367) no Hoare annotation was computed. [2022-04-27 15:02:54,545 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 288 422) the Hoare annotation is: (or (and (= |old(~Executive~0)| ~Executive~0) (= ~DC~0 |old(~DC~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~IPC~0 |old(~IPC~0)|) (= ~NP~0 |old(~s~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-27 15:02:54,545 INFO L899 garLoopResultBuilder]: For program point L386(lines 386 415) no Hoare annotation was computed. [2022-04-27 15:02:54,545 INFO L895 garLoopResultBuilder]: At program point L353(lines 352 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= main_~__cil_tmp8~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-27 15:02:54,545 INFO L899 garLoopResultBuilder]: For program point L378(lines 378 382) no Hoare annotation was computed. [2022-04-27 15:02:54,545 INFO L899 garLoopResultBuilder]: For program point L370(lines 370 374) no Hoare annotation was computed. [2022-04-27 15:02:54,545 INFO L899 garLoopResultBuilder]: For program point L337(lines 323 368) no Hoare annotation was computed. [2022-04-27 15:02:54,545 INFO L899 garLoopResultBuilder]: For program point L387(lines 387 414) no Hoare annotation was computed. [2022-04-27 15:02:54,545 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-27 15:02:54,545 INFO L899 garLoopResultBuilder]: For program point L321-1(lines 297 421) no Hoare annotation was computed. [2022-04-27 15:02:54,545 INFO L899 garLoopResultBuilder]: For program point L404(lines 404 412) no Hoare annotation was computed. [2022-04-27 15:02:54,546 INFO L895 garLoopResultBuilder]: At program point L396(lines 387 414) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-27 15:02:54,546 INFO L899 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-04-27 15:02:54,546 INFO L895 garLoopResultBuilder]: At program point L355(lines 354 367) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= main_~status~1 0) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-27 15:02:54,546 INFO L899 garLoopResultBuilder]: For program point L405(lines 405 407) no Hoare annotation was computed. [2022-04-27 15:02:54,546 INFO L899 garLoopResultBuilder]: For program point L389(lines 389 391) no Hoare annotation was computed. [2022-04-27 15:02:54,546 INFO L895 garLoopResultBuilder]: At program point L323(lines 297 421) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~SKIP1~0 ~NP~0)) (= main_~__cil_tmp8~0 1) (= ~pended~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-27 15:02:54,546 INFO L899 garLoopResultBuilder]: For program point L340-1(lines 339 349) no Hoare annotation was computed. [2022-04-27 15:02:54,546 INFO L899 garLoopResultBuilder]: For program point L398(lines 398 402) no Hoare annotation was computed. [2022-04-27 15:02:54,546 INFO L899 garLoopResultBuilder]: For program point L332(lines 332 335) no Hoare annotation was computed. [2022-04-27 15:02:54,546 INFO L895 garLoopResultBuilder]: At program point L332-2(lines 332 335) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~pended~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= main_~status~1 0) (<= 5 ~MPR1~0) (= ~s~0 ~NP~0) (not (= ~SKIP1~0 ~NP~0)) (= ~NP~0 1) (= ~pended~0 0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-27 15:02:54,546 INFO L895 garLoopResultBuilder]: At program point L457(lines 456 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (= ~MPR1~0 ~s~0) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-27 15:02:54,546 INFO L899 garLoopResultBuilder]: For program point L445(lines 445 448) no Hoare annotation was computed. [2022-04-27 15:02:54,546 INFO L899 garLoopResultBuilder]: For program point L445-1(lines 445 448) no Hoare annotation was computed. [2022-04-27 15:02:54,546 INFO L895 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 437 500) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) .cse1 (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3) (or .cse0 .cse1 (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-27 15:02:54,546 INFO L899 garLoopResultBuilder]: For program point IofCallDriverFINAL(lines 437 500) no Hoare annotation was computed. [2022-04-27 15:02:54,546 INFO L899 garLoopResultBuilder]: For program point L479(lines 479 496) no Hoare annotation was computed. [2022-04-27 15:02:54,547 INFO L895 garLoopResultBuilder]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-27 15:02:54,547 INFO L899 garLoopResultBuilder]: For program point L446-1(line 446) no Hoare annotation was computed. [2022-04-27 15:02:54,547 INFO L895 garLoopResultBuilder]: At program point L471(lines 444 499) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~compRegistered~0 0)) (.cse3 (not (= ~pended~0 0)))) (and (let ((.cse1 (= ~MPR1~0 ~s~0))) (or .cse0 (and (<= IofCallDriver_~returnVal2~0 0) .cse1) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse2 .cse3)) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse2) (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-27 15:02:54,547 INFO L899 garLoopResultBuilder]: For program point IofCallDriverEXIT(lines 437 500) no Hoare annotation was computed. [2022-04-27 15:02:54,547 INFO L895 garLoopResultBuilder]: At program point L459(lines 458 473) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0)) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-27 15:02:54,548 INFO L899 garLoopResultBuilder]: For program point L488(lines 488 495) no Hoare annotation was computed. [2022-04-27 15:02:54,548 INFO L899 garLoopResultBuilder]: For program point L451(lines 451 474) no Hoare annotation was computed. [2022-04-27 15:02:54,548 INFO L899 garLoopResultBuilder]: For program point L480(lines 480 486) no Hoare annotation was computed. [2022-04-27 15:02:54,548 INFO L895 garLoopResultBuilder]: At program point L447(line 447) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-27 15:02:54,548 INFO L895 garLoopResultBuilder]: At program point L493(line 493) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) .cse1 .cse2) (or .cse0 (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-27 15:02:54,548 INFO L899 garLoopResultBuilder]: For program point L493-1(lines 475 497) no Hoare annotation was computed. [2022-04-27 15:02:54,548 INFO L899 garLoopResultBuilder]: For program point L456(lines 456 473) no Hoare annotation was computed. [2022-04-27 15:02:54,549 INFO L895 garLoopResultBuilder]: At program point L452(lines 451 474) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~compRegistered~0 0)) (.cse2 (not (= ~pended~0 0)))) (and (or .cse0 (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (= ~MPR1~0 ~s~0) .cse1 .cse2) (or .cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not .cse1) (not (= ~SKIP1~0 |old(~s~0)|)) .cse2))) [2022-04-27 15:02:54,549 INFO L895 garLoopResultBuilder]: At program point L431(line 431) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-27 15:02:54,549 INFO L899 garLoopResultBuilder]: For program point L431-1(lines 423 436) no Hoare annotation was computed. [2022-04-27 15:02:54,549 INFO L895 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 423 436) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (= ~setEventCalled~0 1)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-04-27 15:02:54,549 INFO L899 garLoopResultBuilder]: For program point stubMoreProcessingRequiredEXIT(lines 423 436) no Hoare annotation was computed. [2022-04-27 15:02:54,549 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:02:54,549 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~Executive~0)| ~Executive~0) (= |old(~compRegistered~0)| ~compRegistered~0) (= ~DC~0 |old(~DC~0)|) (= |old(~SKIP1~0)| ~SKIP1~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~MPR3~0 |old(~MPR3~0)|) (= ~MPR1~0 |old(~MPR1~0)|) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~KernelMode~0 |old(~KernelMode~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~NP~0 |old(~NP~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~pended~0 |old(~pended~0)|) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 15:02:54,549 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:02:54,549 INFO L895 garLoopResultBuilder]: At program point L543(line 543) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-27 15:02:54,549 INFO L899 garLoopResultBuilder]: For program point L541(lines 541 545) no Hoare annotation was computed. [2022-04-27 15:02:54,549 INFO L899 garLoopResultBuilder]: For program point L541-1(lines 528 547) no Hoare annotation was computed. [2022-04-27 15:02:54,549 INFO L899 garLoopResultBuilder]: For program point KeWaitForSingleObjectEXIT(lines 523 564) no Hoare annotation was computed. [2022-04-27 15:02:54,549 INFO L899 garLoopResultBuilder]: For program point L529(lines 529 534) no Hoare annotation was computed. [2022-04-27 15:02:54,549 INFO L899 garLoopResultBuilder]: For program point L550(lines 550 562) no Hoare annotation was computed. [2022-04-27 15:02:54,549 INFO L899 garLoopResultBuilder]: For program point KeWaitForSingleObjectFINAL(lines 523 564) no Hoare annotation was computed. [2022-04-27 15:02:54,549 INFO L895 garLoopResultBuilder]: At program point L536(lines 528 547) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-27 15:02:54,549 INFO L899 garLoopResultBuilder]: For program point L528(lines 528 547) no Hoare annotation was computed. [2022-04-27 15:02:54,550 INFO L895 garLoopResultBuilder]: At program point L553(lines 552 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-27 15:02:54,550 INFO L895 garLoopResultBuilder]: At program point L551(lines 550 562) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (= |old(~setEventCalled~0)| 1))) (.cse4 (= ~compRegistered~0 0)) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 (= ~s~0 |old(~s~0)|) .cse5) (or .cse0 .cse1 .cse2 (= ~s~0 ~NP~0) .cse3 .cse4 .cse5 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-27 15:02:54,550 INFO L895 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 523 564) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (= ~compRegistered~0 0)) (.cse6 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 (not (= ~NP~0 |old(~s~0)|)) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-27 15:02:54,550 INFO L895 garLoopResultBuilder]: At program point L509(line 509) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (not (= ~pended~0 0))) [2022-04-27 15:02:54,550 INFO L899 garLoopResultBuilder]: For program point L509-1(lines 501 514) no Hoare annotation was computed. [2022-04-27 15:02:54,550 INFO L895 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 501 514) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 |old(~s~0)|)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|) (not (= ~pended~0 0))) [2022-04-27 15:02:54,550 INFO L899 garLoopResultBuilder]: For program point L505(lines 505 511) no Hoare annotation was computed. [2022-04-27 15:02:54,550 INFO L899 garLoopResultBuilder]: For program point IofCompleteRequestEXIT(lines 501 514) no Hoare annotation was computed. [2022-04-27 15:02:54,550 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:02:54,550 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (= ~s~0 ~NP~0) (= ~SKIP1~0 ~s~0) (= ~pended~0 0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-04-27 15:02:54,550 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 15:02:54,550 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:02:54,550 INFO L899 garLoopResultBuilder]: For program point L192(lines 192 198) no Hoare annotation was computed. [2022-04-27 15:02:54,550 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 265) no Hoare annotation was computed. [2022-04-27 15:02:54,550 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 276) no Hoare annotation was computed. [2022-04-27 15:02:54,550 INFO L899 garLoopResultBuilder]: For program point L192-2(lines 166 261) no Hoare annotation was computed. [2022-04-27 15:02:54,550 INFO L895 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L242-1(line 242) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L176(lines 176 182) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L176-1(lines 171 183) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L201(lines 201 205) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L135(lines 135 273) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 284) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L895 garLoopResultBuilder]: At program point L226(lines 226 227) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L226-1(lines 226 227) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L895 garLoopResultBuilder]: At program point L251(line 251) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L251-1(lines 247 253) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L144(lines 144 270) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L111(lines 111 281) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L895 garLoopResultBuilder]: At program point L103(lines 102 284) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,551 INFO L895 garLoopResultBuilder]: At program point L194(lines 194 196) the Hoare annotation is: (let ((.cse4 (= ~setEventCalled~0 1)) (.cse5 (not (= ~compRegistered~0 0))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse6 (<= 259 KbFilter_PnP_~status~0)) (.cse10 (<= 5 ~MPR1~0)) (.cse11 (= ~NP~0 |old(~s~0)|)) (.cse12 (= ~NP~0 1))) (let ((.cse1 (not .cse12)) (.cse2 (not .cse11)) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse7 (not .cse10)) (.cse8 (and .cse4 .cse10 .cse5 .cse11 (not .cse0) .cse12 .cse6 (= ~s~0 |old(~s~0)|))) (.cse9 (not (= ~pended~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 (< 258 KbFilter_PnP_~__cil_tmp23~0) .cse5 (<= KbFilter_PnP_~__cil_tmp23~0 259) .cse6 (= ~MPR3~0 ~s~0)) .cse7 .cse8 .cse9) (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse7 .cse8 .cse9)))) [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L194-1(lines 194 196) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L153(lines 153 267) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 278) no Hoare annotation was computed. [2022-04-27 15:02:54,551 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (and (not (= ~compRegistered~0 0)) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,552 INFO L895 garLoopResultBuilder]: At program point L178(line 178) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,552 INFO L899 garLoopResultBuilder]: For program point KbFilter_PnPEXIT(lines 75 287) no Hoare annotation was computed. [2022-04-27 15:02:54,552 INFO L895 garLoopResultBuilder]: At program point L236(line 236) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,552 INFO L899 garLoopResultBuilder]: For program point L236-1(lines 232 238) no Hoare annotation was computed. [2022-04-27 15:02:54,552 INFO L899 garLoopResultBuilder]: For program point L162(lines 162 264) no Hoare annotation was computed. [2022-04-27 15:02:54,552 INFO L899 garLoopResultBuilder]: For program point L129(lines 129 275) no Hoare annotation was computed. [2022-04-27 15:02:54,552 INFO L895 garLoopResultBuilder]: At program point L220(line 220) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,552 INFO L895 garLoopResultBuilder]: At program point L187(lines 187 188) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (not (= ~NP~0 1))) (.cse2 (not (= ~NP~0 |old(~s~0)|))) (.cse3 (not (= |old(~compRegistered~0)| 0))) (.cse4 (not (<= 5 ~MPR1~0))) (.cse5 (not (= ~pended~0 0)))) (and (or .cse0 (not (<= (+ |old(~myStatus~0)| 1073741637) 0)) .cse1 (<= (+ ~myStatus~0 1073741637) 0) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (not (= ~compRegistered~0 0)) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) .cse5))) [2022-04-27 15:02:54,552 INFO L899 garLoopResultBuilder]: For program point L220-1(lines 216 222) no Hoare annotation was computed. [2022-04-27 15:02:54,552 INFO L899 garLoopResultBuilder]: For program point L187-1(lines 187 188) no Hoare annotation was computed. [2022-04-27 15:02:54,552 INFO L895 garLoopResultBuilder]: At program point KbFilter_PnPENTRY(lines 75 287) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,552 INFO L899 garLoopResultBuilder]: For program point L171(lines 171 183) no Hoare annotation was computed. [2022-04-27 15:02:54,552 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 272) no Hoare annotation was computed. [2022-04-27 15:02:54,552 INFO L899 garLoopResultBuilder]: For program point L105(lines 105 283) no Hoare annotation was computed. [2022-04-27 15:02:54,552 INFO L899 garLoopResultBuilder]: For program point KbFilter_PnPFINAL(lines 75 287) no Hoare annotation was computed. [2022-04-27 15:02:54,552 INFO L902 garLoopResultBuilder]: At program point L262(lines 166 263) the Hoare annotation is: true [2022-04-27 15:02:54,552 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 269) no Hoare annotation was computed. [2022-04-27 15:02:54,552 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 280) no Hoare annotation was computed. [2022-04-27 15:02:54,553 INFO L895 garLoopResultBuilder]: At program point L106(lines 105 283) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,553 INFO L899 garLoopResultBuilder]: For program point L156(lines 156 266) no Hoare annotation was computed. [2022-04-27 15:02:54,553 INFO L899 garLoopResultBuilder]: For program point L123(lines 123 277) no Hoare annotation was computed. [2022-04-27 15:02:54,553 INFO L895 garLoopResultBuilder]: At program point L173(line 173) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,553 INFO L895 garLoopResultBuilder]: At program point L165(lines 111 281) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,553 INFO L899 garLoopResultBuilder]: For program point L132(lines 132 274) no Hoare annotation was computed. [2022-04-27 15:02:54,553 INFO L899 garLoopResultBuilder]: For program point L141(lines 141 271) no Hoare annotation was computed. [2022-04-27 15:02:54,553 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 282) no Hoare annotation was computed. [2022-04-27 15:02:54,553 INFO L899 garLoopResultBuilder]: For program point L232(lines 232 238) no Hoare annotation was computed. [2022-04-27 15:02:54,553 INFO L895 garLoopResultBuilder]: At program point L257(lines 257 258) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,553 INFO L899 garLoopResultBuilder]: For program point L257-1(lines 257 258) no Hoare annotation was computed. [2022-04-27 15:02:54,553 INFO L899 garLoopResultBuilder]: For program point L216(lines 216 222) no Hoare annotation was computed. [2022-04-27 15:02:54,553 INFO L899 garLoopResultBuilder]: For program point L150(lines 150 268) no Hoare annotation was computed. [2022-04-27 15:02:54,553 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 279) no Hoare annotation was computed. [2022-04-27 15:02:54,553 INFO L895 garLoopResultBuilder]: At program point L109(lines 108 282) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~pended~0 0))) [2022-04-27 15:02:54,553 INFO L899 garLoopResultBuilder]: For program point L200(lines 200 206) no Hoare annotation was computed. [2022-04-27 15:02:54,556 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:02:54,557 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:02:54,559 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:02:54,559 WARN L170 areAnnotationChecker]: KeSetEventFINAL has no Hoare annotation [2022-04-27 15:02:54,577 WARN L170 areAnnotationChecker]: stub_driver_initFINAL has no Hoare annotation [2022-04-27 15:02:54,577 WARN L170 areAnnotationChecker]: _BLAST_initFINAL has no Hoare annotation [2022-04-27 15:02:54,577 WARN L170 areAnnotationChecker]: errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-27 15:02:54,577 WARN L170 areAnnotationChecker]: errorFnFINAL has no Hoare annotation [2022-04-27 15:02:54,578 WARN L170 areAnnotationChecker]: L445 has no Hoare annotation [2022-04-27 15:02:54,578 WARN L170 areAnnotationChecker]: L431-1 has no Hoare annotation [2022-04-27 15:02:54,579 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:02:54,579 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2022-04-27 15:02:54,579 WARN L170 areAnnotationChecker]: L505 has no Hoare annotation [2022-04-27 15:02:54,580 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-27 15:02:54,580 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:02:54,580 WARN L170 areAnnotationChecker]: KeSetEventFINAL has no Hoare annotation [2022-04-27 15:02:54,580 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2022-04-27 15:02:54,581 WARN L170 areAnnotationChecker]: stub_driver_initFINAL has no Hoare annotation [2022-04-27 15:02:54,581 WARN L170 areAnnotationChecker]: _BLAST_initFINAL has no Hoare annotation [2022-04-27 15:02:54,581 WARN L170 areAnnotationChecker]: errorFnFINAL has no Hoare annotation [2022-04-27 15:02:54,581 WARN L170 areAnnotationChecker]: L321-1 has no Hoare annotation [2022-04-27 15:02:54,582 WARN L170 areAnnotationChecker]: L445 has no Hoare annotation [2022-04-27 15:02:54,582 WARN L170 areAnnotationChecker]: L445 has no Hoare annotation [2022-04-27 15:02:54,582 WARN L170 areAnnotationChecker]: L431-1 has no Hoare annotation [2022-04-27 15:02:54,583 WARN L170 areAnnotationChecker]: L431-1 has no Hoare annotation [2022-04-27 15:02:54,583 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:02:54,583 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2022-04-27 15:02:54,583 WARN L170 areAnnotationChecker]: L528 has no Hoare annotation [2022-04-27 15:02:54,583 WARN L170 areAnnotationChecker]: L505 has no Hoare annotation [2022-04-27 15:02:54,583 WARN L170 areAnnotationChecker]: L505 has no Hoare annotation [2022-04-27 15:02:54,583 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: KeSetEventEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: L571-1 has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: stub_driver_initEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: _BLAST_initEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: errorFnEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: errorFnEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: errorFnEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: errorFnEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: errorFnEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: errorFnEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: errorFnEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: errorFnEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: errorFnEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: errorFnEXIT has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: L321-1 has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: L321-1 has no Hoare annotation [2022-04-27 15:02:54,584 WARN L170 areAnnotationChecker]: L446-1 has no Hoare annotation [2022-04-27 15:02:54,585 WARN L170 areAnnotationChecker]: L445-1 has no Hoare annotation [2022-04-27 15:02:54,585 WARN L170 areAnnotationChecker]: stubMoreProcessingRequiredEXIT has no Hoare annotation [2022-04-27 15:02:54,585 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:02:54,585 WARN L170 areAnnotationChecker]: L529 has no Hoare annotation [2022-04-27 15:02:54,585 WARN L170 areAnnotationChecker]: L529 has no Hoare annotation [2022-04-27 15:02:54,585 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2022-04-27 15:02:54,585 WARN L170 areAnnotationChecker]: L541 has no Hoare annotation [2022-04-27 15:02:54,585 WARN L170 areAnnotationChecker]: L509-1 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L509-1 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: KbFilter_CompleteFINAL has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L337 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L337 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L493-1 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L176-1 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L220-1 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L236-1 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L251-1 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L332 has no Hoare annotation [2022-04-27 15:02:54,586 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L446-1 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L451 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L451 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L541 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L541 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: IofCompleteRequestEXIT has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: KbFilter_CompleteEXIT has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L340-1 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L340-1 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: IofCallDriverFINAL has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L550 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L550 has no Hoare annotation [2022-04-27 15:02:54,587 WARN L170 areAnnotationChecker]: L187-1 has no Hoare annotation [2022-04-27 15:02:54,588 WARN L170 areAnnotationChecker]: L226-1 has no Hoare annotation [2022-04-27 15:02:54,589 WARN L170 areAnnotationChecker]: L242-1 has no Hoare annotation [2022-04-27 15:02:54,590 WARN L170 areAnnotationChecker]: L257-1 has no Hoare annotation [2022-04-27 15:02:54,590 WARN L170 areAnnotationChecker]: L337 has no Hoare annotation [2022-04-27 15:02:54,591 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2022-04-27 15:02:54,591 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2022-04-27 15:02:54,591 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-04-27 15:02:54,592 WARN L170 areAnnotationChecker]: L445-1 has no Hoare annotation [2022-04-27 15:02:54,593 WARN L170 areAnnotationChecker]: L456 has no Hoare annotation [2022-04-27 15:02:54,593 WARN L170 areAnnotationChecker]: L456 has no Hoare annotation [2022-04-27 15:02:54,593 WARN L170 areAnnotationChecker]: L541-1 has no Hoare annotation [2022-04-27 15:02:54,593 WARN L170 areAnnotationChecker]: KbFilter_PnPFINAL has no Hoare annotation [2022-04-27 15:02:54,593 WARN L170 areAnnotationChecker]: L176-1 has no Hoare annotation [2022-04-27 15:02:54,593 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2022-04-27 15:02:54,593 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2022-04-27 15:02:54,593 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2022-04-27 15:02:54,593 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2022-04-27 15:02:54,593 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2022-04-27 15:02:54,593 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-27 15:02:54,593 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: L352 has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: L352 has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: IofCallDriverEXIT has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: IofCallDriverEXIT has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: IofCallDriverEXIT has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: IofCallDriverEXIT has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: KeWaitForSingleObjectFINAL has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: KeWaitForSingleObjectFINAL has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: L187-1 has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: L226-1 has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: L242-1 has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: L257-1 has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: L378 has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: L386 has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: L493-1 has no Hoare annotation [2022-04-27 15:02:54,594 WARN L170 areAnnotationChecker]: L479 has no Hoare annotation [2022-04-27 15:02:54,596 WARN L170 areAnnotationChecker]: KbFilter_PnPFINAL has no Hoare annotation [2022-04-27 15:02:54,596 WARN L170 areAnnotationChecker]: L176-1 has no Hoare annotation [2022-04-27 15:02:54,596 WARN L170 areAnnotationChecker]: L220-1 has no Hoare annotation [2022-04-27 15:02:54,596 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2022-04-27 15:02:54,596 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2022-04-27 15:02:54,596 WARN L170 areAnnotationChecker]: L251-1 has no Hoare annotation [2022-04-27 15:02:54,596 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-04-27 15:02:54,597 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-04-27 15:02:54,597 WARN L170 areAnnotationChecker]: L359 has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: KeWaitForSingleObjectFINAL has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: L386 has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: L386 has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: L479 has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: L479 has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: KbFilter_PnPEXIT has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: L236-1 has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: L251-1 has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: L359 has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: KeWaitForSingleObjectEXIT has no Hoare annotation [2022-04-27 15:02:54,598 WARN L170 areAnnotationChecker]: L194-1 has no Hoare annotation [2022-04-27 15:02:54,599 WARN L170 areAnnotationChecker]: L192-2 has no Hoare annotation [2022-04-27 15:02:54,599 WARN L170 areAnnotationChecker]: L192-2 has no Hoare annotation [2022-04-27 15:02:54,599 WARN L170 areAnnotationChecker]: L387 has no Hoare annotation [2022-04-27 15:02:54,599 WARN L170 areAnnotationChecker]: L387 has no Hoare annotation [2022-04-27 15:02:54,599 WARN L170 areAnnotationChecker]: L480 has no Hoare annotation [2022-04-27 15:02:54,599 WARN L170 areAnnotationChecker]: L480 has no Hoare annotation [2022-04-27 15:02:54,599 WARN L170 areAnnotationChecker]: L488 has no Hoare annotation [2022-04-27 15:02:54,599 WARN L170 areAnnotationChecker]: L488 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L194-1 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L388 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L398 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L404 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L493-1 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-27 15:02:54,600 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L389 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L389 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L398 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L398 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L404 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L404 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L385 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L405 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L405 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L409 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L409 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L129 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-04-27 15:02:54,601 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-04-27 15:02:54,602 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2022-04-27 15:02:54,602 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2022-04-27 15:02:54,602 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2022-04-27 15:02:54,602 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2022-04-27 15:02:54,602 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2022-04-27 15:02:54,602 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2022-04-27 15:02:54,602 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2022-04-27 15:02:54,602 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2022-04-27 15:02:54,602 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-04-27 15:02:54,602 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-04-27 15:02:54,602 INFO L163 areAnnotationChecker]: CFG has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 15:02:54,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:02:54 BoogieIcfgContainer [2022-04-27 15:02:54,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:02:54,635 INFO L158 Benchmark]: Toolchain (without parser) took 23377.01ms. Allocated memory was 204.5MB in the beginning and 449.8MB in the end (delta: 245.4MB). Free memory was 179.6MB in the beginning and 160.7MB in the end (delta: 19.0MB). Peak memory consumption was 269.6MB. Max. memory is 8.0GB. [2022-04-27 15:02:54,635 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 167.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:02:54,635 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.07ms. Allocated memory is still 204.5MB. Free memory was 179.4MB in the beginning and 174.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-27 15:02:54,635 INFO L158 Benchmark]: Boogie Preprocessor took 65.42ms. Allocated memory is still 204.5MB. Free memory was 174.3MB in the beginning and 171.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:02:54,635 INFO L158 Benchmark]: RCFGBuilder took 480.39ms. Allocated memory is still 204.5MB. Free memory was 171.8MB in the beginning and 143.8MB in the end (delta: 28.0MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-04-27 15:02:54,635 INFO L158 Benchmark]: TraceAbstraction took 22424.43ms. Allocated memory was 204.5MB in the beginning and 449.8MB in the end (delta: 245.4MB). Free memory was 143.1MB in the beginning and 160.7MB in the end (delta: -17.5MB). Peak memory consumption was 233.9MB. Max. memory is 8.0GB. [2022-04-27 15:02:54,636 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 167.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 400.07ms. Allocated memory is still 204.5MB. Free memory was 179.4MB in the beginning and 174.3MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.42ms. Allocated memory is still 204.5MB. Free memory was 174.3MB in the beginning and 171.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 480.39ms. Allocated memory is still 204.5MB. Free memory was 171.8MB in the beginning and 143.8MB in the end (delta: 28.0MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 22424.43ms. Allocated memory was 204.5MB in the beginning and 449.8MB in the end (delta: 245.4MB). Free memory was 143.1MB in the beginning and 160.7MB in the end (delta: -17.5MB). Peak memory consumption was 233.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 581]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 154 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2940 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2932 mSDsluCounter, 4446 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2435 mSDsCounter, 911 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4642 IncrementalHoareTripleChecker+Invalid, 5553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 911 mSolverCounterUnsat, 2011 mSDtfsCounter, 4642 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 158 SyntacticMatches, 4 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=3, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 144 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 282 PreInvPairs, 348 NumberOfFragments, 2218 HoareAnnotationTreeSize, 282 FomulaSimplifications, 138 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 53 FomulaSimplificationsInter, 3616 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 876 NumberOfCodeBlocks, 876 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 859 ConstructedInterpolants, 0 QuantifiedInterpolants, 3814 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || (((((((status == 0 && 5 <= MPR1) && s == NP) && !(SKIP1 == NP)) && NP == 1) && __cil_tmp8 == 1) && pended == 0) && compRegistered == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 550]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 444]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || (returnVal2 <= 0 && MPR1 == s)) || (((setEventCalled == 1 && returnVal2 <= 259) && 259 <= returnVal2) && MPR1 == s)) || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 458]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || (setEventCalled == 1 && MPR1 == s)) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 297]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 377]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 354]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || status == 0) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 369]: Loop Invariant Derived loop invariant: (((((!(\old(SKIP1) == \old(s)) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(pended) == 0)) || !(\old(s) == \old(MPR1))) || ((!(SKIP1 == NP) && __cil_tmp8 == 1) && pended == 0)) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) - InvariantResult [Line: 528]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || ((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && s == \old(s))) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) && ((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(pended == 0) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || s == \old(s)) || !(pended == 0)) && (((((((SKIP1 == NP || !(NP == 1)) || !(5 <= MPR1)) || s == NP) || !(\old(setEventCalled) == 1)) || compRegistered == 0) || !(pended == 0)) || !(MPR3 == \old(s))) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((SKIP1 == NP || !(NP == 1)) || !(NP == \old(s))) || !(5 <= MPR1)) || MPR1 == s) || compRegistered == 0) || !(pended == 0)) && ((((SKIP1 == NP || ((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(pended == 0)) RESULT: Ultimate proved your program to be correct! [2022-04-27 15:02:54,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...