/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 17:41:14,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:41:14,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:41:14,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:41:14,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:41:14,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:41:14,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:41:14,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:41:14,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:41:14,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:41:14,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:41:14,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:41:14,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:41:14,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:41:14,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:41:14,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:41:14,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:41:14,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:41:14,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:41:14,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:41:14,915 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:41:14,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:41:14,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:41:14,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:41:14,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:41:14,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:41:14,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:41:14,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:41:14,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:41:14,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:41:14,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:41:14,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:41:14,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:41:14,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:41:14,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:41:14,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:41:14,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:41:14,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:41:14,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:41:14,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:41:14,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:41:14,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:41:14,929 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 17:41:14,935 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:41:14,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:41:14,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:41:14,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:41:14,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:41:14,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:41:14,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:41:14,937 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:41:14,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:41:14,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:41:14,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:41:14,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:41:14,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:41:14,938 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:41:14,938 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:41:14,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:41:14,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:41:14,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:41:14,938 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:41:14,938 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:41:14,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:41:14,938 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:41:14,938 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-15 17:41:15,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:41:15,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:41:15,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:41:15,120 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:41:15,121 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:41:15,121 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-04-15 17:41:15,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec394b122/83a3bc20d0eb45eab180f8540c3245fc/FLAGccf547ed2 [2022-04-15 17:41:15,538 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:41:15,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2022-04-15 17:41:15,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec394b122/83a3bc20d0eb45eab180f8540c3245fc/FLAGccf547ed2 [2022-04-15 17:41:15,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec394b122/83a3bc20d0eb45eab180f8540c3245fc [2022-04-15 17:41:15,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:41:15,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:41:15,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:41:15,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:41:15,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:41:15,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:15" (1/1) ... [2022-04-15 17:41:15,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d1e1e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:15, skipping insertion in model container [2022-04-15 17:41:15,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:41:15" (1/1) ... [2022-04-15 17:41:15,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:41:15,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:41:15,771 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_simpl2.cil-1.c[29620,29633] [2022-04-15 17:41:15,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:41:15,778 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:41:15,833 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_simpl2.cil-1.c[29620,29633] [2022-04-15 17:41:15,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:41:15,853 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:41:15,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:15 WrapperNode [2022-04-15 17:41:15,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:41:15,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:41:15,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:41:15,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:41:15,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:15" (1/1) ... [2022-04-15 17:41:15,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:15" (1/1) ... [2022-04-15 17:41:15,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:15" (1/1) ... [2022-04-15 17:41:15,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:15" (1/1) ... [2022-04-15 17:41:15,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:15" (1/1) ... [2022-04-15 17:41:15,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:15" (1/1) ... [2022-04-15 17:41:15,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:15" (1/1) ... [2022-04-15 17:41:15,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:41:15,932 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:41:15,932 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:41:15,932 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:41:15,933 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:15" (1/1) ... [2022-04-15 17:41:15,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:41:15,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:41:15,956 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-15 17:41:15,957 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-15 17:41:15,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:41:15,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:41:15,983 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:41:15,983 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-15 17:41:15,983 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-15 17:41:15,983 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2022-04-15 17:41:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:41:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-15 17:41:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-15 17:41:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-15 17:41:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-15 17:41:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-15 17:41:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2022-04-15 17:41:15,984 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2022-04-15 17:41:15,985 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2022-04-15 17:41:15,986 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2022-04-15 17:41:15,986 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-15 17:41:15,987 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2022-04-15 17:41:15,987 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-15 17:41:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:41:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:41:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:41:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:41:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 17:41:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 17:41:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 17:41:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-15 17:41:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2022-04-15 17:41:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-15 17:41:15,987 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:41:15,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:41:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:41:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:41:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:41:15,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:41:16,076 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:41:16,077 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:41:16,134 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 17:41:16,255 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-04-15 17:41:16,255 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-04-15 17:41:16,259 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 17:41:16,287 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-04-15 17:41:16,287 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-04-15 17:41:16,369 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 17:41:16,379 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-15 17:41:16,379 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-15 17:41:16,384 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 17:41:16,460 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2022-04-15 17:41:16,460 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2022-04-15 17:41:16,464 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 17:41:16,489 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-04-15 17:41:16,489 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-04-15 17:41:16,493 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-15 17:41:16,521 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-04-15 17:41:16,522 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-04-15 17:41:16,566 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:41:16,572 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:41:16,572 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-15 17:41:16,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:16 BoogieIcfgContainer [2022-04-15 17:41:16,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:41:16,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:41:16,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:41:16,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:41:16,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:41:15" (1/3) ... [2022-04-15 17:41:16,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f1c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:16, skipping insertion in model container [2022-04-15 17:41:16,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:41:15" (2/3) ... [2022-04-15 17:41:16,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f1c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:41:16, skipping insertion in model container [2022-04-15 17:41:16,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:41:16" (3/3) ... [2022-04-15 17:41:16,579 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2022-04-15 17:41:16,582 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:41:16,582 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:41:16,646 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:41:16,650 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-15 17:41:16,650 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:41:16,666 INFO L276 IsEmpty]: Start isEmpty. Operand has 239 states, 182 states have (on average 1.5604395604395604) internal successors, (284), 199 states have internal predecessors, (284), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 17:41:16,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 17:41:16,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:16,671 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:16,672 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:16,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:16,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1606654013, now seen corresponding path program 1 times [2022-04-15 17:41:16,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:16,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [365966440] [2022-04-15 17:41:16,687 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:16,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1606654013, now seen corresponding path program 2 times [2022-04-15 17:41:16,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:16,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337653657] [2022-04-15 17:41:16,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:16,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:16,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:16,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {251#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {242#true} is VALID [2022-04-15 17:41:16,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} assume true; {242#true} is VALID [2022-04-15 17:41:16,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {242#true} {242#true} #780#return; {242#true} is VALID [2022-04-15 17:41:17,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:17,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#(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; {242#true} is VALID [2022-04-15 17:41:17,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} assume true; {242#true} is VALID [2022-04-15 17:41:17,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {242#true} {247#(= main_~status~1 0)} #714#return; {247#(= main_~status~1 0)} is VALID [2022-04-15 17:41:17,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {242#true} call ULTIMATE.init(); {251#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:17,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {242#true} is VALID [2022-04-15 17:41:17,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2022-04-15 17:41:17,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #780#return; {242#true} is VALID [2022-04-15 17:41:17,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {242#true} call #t~ret83 := main(); {242#true} is VALID [2022-04-15 17:41:17,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {242#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;~DevicePowerState~0 := 1;~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; {247#(= main_~status~1 0)} is VALID [2022-04-15 17:41:17,032 INFO L272 TraceCheckUtils]: 6: Hoare triple {247#(= main_~status~1 0)} call _BLAST_init(); {252#(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-15 17:41:17,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {252#(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; {242#true} is VALID [2022-04-15 17:41:17,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {242#true} assume true; {242#true} is VALID [2022-04-15 17:41:17,033 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {242#true} {247#(= main_~status~1 0)} #714#return; {247#(= main_~status~1 0)} is VALID [2022-04-15 17:41:17,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {247#(= main_~status~1 0)} assume !(~status~1 >= 0); {243#false} is VALID [2022-04-15 17:41:17,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#false} assume !(1 == ~pended~0); {243#false} is VALID [2022-04-15 17:41:17,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {243#false} assume !(1 == ~pended~0); {243#false} is VALID [2022-04-15 17:41:17,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#false} assume ~s~0 != ~UNLOADED~0; {243#false} is VALID [2022-04-15 17:41:17,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {243#false} assume -1 != ~status~1; {243#false} is VALID [2022-04-15 17:41:17,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#false} assume !(~s~0 != ~SKIP2~0); {243#false} is VALID [2022-04-15 17:41:17,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {243#false} assume 1 == ~pended~0; {243#false} is VALID [2022-04-15 17:41:17,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {243#false} assume 259 != ~status~1; {243#false} is VALID [2022-04-15 17:41:17,036 INFO L272 TraceCheckUtils]: 18: Hoare triple {243#false} call errorFn(); {243#false} is VALID [2022-04-15 17:41:17,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-04-15 17:41:17,037 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-15 17:41:17,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:17,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337653657] [2022-04-15 17:41:17,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337653657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:17,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:17,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:41:17,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:17,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [365966440] [2022-04-15 17:41:17,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [365966440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:17,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:17,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:41:17,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396022202] [2022-04-15 17:41:17,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:17,053 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-15 17:41:17,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:17,056 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-15 17:41:17,104 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-15 17:41:17,104 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:41:17,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:17,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:41:17,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:41:17,123 INFO L87 Difference]: Start difference. First operand has 239 states, 182 states have (on average 1.5604395604395604) internal successors, (284), 199 states have internal predecessors, (284), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) 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-15 17:41:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:18,721 INFO L93 Difference]: Finished difference Result 415 states and 624 transitions. [2022-04-15 17:41:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 17:41:18,722 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-15 17:41:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:18,723 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-15 17:41:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2022-04-15 17:41:18,738 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-15 17:41:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2022-04-15 17:41:18,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 624 transitions. [2022-04-15 17:41:19,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 624 edges. 624 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:19,300 INFO L225 Difference]: With dead ends: 415 [2022-04-15 17:41:19,301 INFO L226 Difference]: Without dead ends: 256 [2022-04-15 17:41:19,307 INFO L912 BasicCegarLoop]: 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-15 17:41:19,310 INFO L913 BasicCegarLoop]: 296 mSDtfsCounter, 173 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:19,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 446 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 17:41:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-15 17:41:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2022-04-15 17:41:19,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:19,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 228 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 189 states have internal predecessors, (260), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 17:41:19,376 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 228 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 189 states have internal predecessors, (260), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 17:41:19,376 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 228 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 189 states have internal predecessors, (260), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 17:41:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:19,392 INFO L93 Difference]: Finished difference Result 256 states and 363 transitions. [2022-04-15 17:41:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 363 transitions. [2022-04-15 17:41:19,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:19,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:19,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 189 states have internal predecessors, (260), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 256 states. [2022-04-15 17:41:19,395 INFO L87 Difference]: Start difference. First operand has 228 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 189 states have internal predecessors, (260), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 256 states. [2022-04-15 17:41:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:19,408 INFO L93 Difference]: Finished difference Result 256 states and 363 transitions. [2022-04-15 17:41:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 363 transitions. [2022-04-15 17:41:19,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:19,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:19,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:19,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 189 states have internal predecessors, (260), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 17:41:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2022-04-15 17:41:19,424 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2022-04-15 17:41:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:19,424 INFO L478 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2022-04-15 17:41:19,424 INFO L479 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-15 17:41:19,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 228 states and 322 transitions. [2022-04-15 17:41:19,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 322 edges. 322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2022-04-15 17:41:19,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:41:19,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:19,697 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:19,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:41:19,697 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:19,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:19,698 INFO L85 PathProgramCache]: Analyzing trace with hash -584418248, now seen corresponding path program 1 times [2022-04-15 17:41:19,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:19,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1535571812] [2022-04-15 17:41:19,704 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:19,705 INFO L85 PathProgramCache]: Analyzing trace with hash -584418248, now seen corresponding path program 2 times [2022-04-15 17:41:19,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:19,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490863603] [2022-04-15 17:41:19,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:19,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:19,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:19,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {2065#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {2053#true} is VALID [2022-04-15 17:41:19,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {2053#true} assume true; {2053#true} is VALID [2022-04-15 17:41:19,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2053#true} {2053#true} #780#return; {2053#true} is VALID [2022-04-15 17:41:19,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:19,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {2066#(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; {2053#true} is VALID [2022-04-15 17:41:19,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {2053#true} assume true; {2053#true} is VALID [2022-04-15 17:41:19,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2053#true} {2053#true} #714#return; {2053#true} is VALID [2022-04-15 17:41:19,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:19,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {2067#(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; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {2064#(= ~s~0 ~NP~0)} assume true; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2064#(= ~s~0 ~NP~0)} {2053#true} #716#return; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {2053#true} call ULTIMATE.init(); {2065#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:19,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {2053#true} is VALID [2022-04-15 17:41:19,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {2053#true} assume true; {2053#true} is VALID [2022-04-15 17:41:19,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2053#true} {2053#true} #780#return; {2053#true} is VALID [2022-04-15 17:41:19,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {2053#true} call #t~ret83 := main(); {2053#true} is VALID [2022-04-15 17:41:19,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {2053#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;~DevicePowerState~0 := 1;~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; {2053#true} is VALID [2022-04-15 17:41:19,851 INFO L272 TraceCheckUtils]: 6: Hoare triple {2053#true} call _BLAST_init(); {2066#(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-15 17:41:19,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {2066#(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; {2053#true} is VALID [2022-04-15 17:41:19,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {2053#true} assume true; {2053#true} is VALID [2022-04-15 17:41:19,853 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2053#true} {2053#true} #714#return; {2053#true} is VALID [2022-04-15 17:41:19,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {2053#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; {2053#true} is VALID [2022-04-15 17:41:19,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {2053#true} assume !(0 == ~irp_choice~0); {2053#true} is VALID [2022-04-15 17:41:19,853 INFO L272 TraceCheckUtils]: 12: Hoare triple {2053#true} call stub_driver_init(); {2067#(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-15 17:41:19,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {2067#(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; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {2064#(= ~s~0 ~NP~0)} assume true; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,857 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2064#(= ~s~0 ~NP~0)} {2053#true} #716#return; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {2064#(= ~s~0 ~NP~0)} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {2064#(= ~s~0 ~NP~0)} assume 0 == ~tmp_ndt_1~0; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,859 INFO L272 TraceCheckUtils]: 18: Hoare triple {2064#(= ~s~0 ~NP~0)} call #t~ret31 := KbFilter_CreateClose(~devobj~0, ~pirp~0); {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {2064#(= ~s~0 ~NP~0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;assume -2147483648 <= #t~nondet43 && #t~nondet43 <= 2147483647;~irpStack__MajorFunction~0 := #t~nondet43;havoc #t~nondet43;assume -2147483648 <= #t~nondet44 && #t~nondet44 <= 2147483647;~devExt__UpperConnectData__ClassService~0 := #t~nondet44;havoc #t~nondet44;havoc ~Irp__IoStatus__Status~1;havoc ~status~2;havoc ~tmp~0;~status~2 := ~myStatus~0; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {2064#(= ~s~0 ~NP~0)} assume 0 == ~irpStack__MajorFunction~0; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {2064#(= ~s~0 ~NP~0)} assume 0 == ~devExt__UpperConnectData__ClassService~0;~status~2 := -1073741436; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {2064#(= ~s~0 ~NP~0)} ~Irp__IoStatus__Status~1 := ~status~2;~myStatus~0 := ~status~2; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,862 INFO L272 TraceCheckUtils]: 23: Hoare triple {2064#(= ~s~0 ~NP~0)} call #t~ret45 := KbFilter_DispatchPassThrough(~DeviceObject, ~Irp); {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {2064#(= ~s~0 ~NP~0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;assume -2147483648 <= #t~nondet46 && #t~nondet46 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~1 := #t~nondet46;havoc #t~nondet46;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~Irp__CurrentLocation~1 := #t~nondet47;havoc #t~nondet47;assume -2147483648 <= #t~nondet48 && #t~nondet48 <= 2147483647;~DeviceObject__DeviceExtension__TopOfStack~0 := #t~nondet48;havoc #t~nondet48;havoc ~irpStack~1;havoc ~tmp~1;~irpStack~1 := ~Irp__Tail__Overlay__CurrentStackLocation~1; {2064#(= ~s~0 ~NP~0)} is VALID [2022-04-15 17:41:19,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {2064#(= ~s~0 ~NP~0)} assume !(~s~0 == ~NP~0); {2054#false} is VALID [2022-04-15 17:41:19,863 INFO L272 TraceCheckUtils]: 26: Hoare triple {2054#false} call errorFn(); {2054#false} is VALID [2022-04-15 17:41:19,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {2054#false} assume !false; {2054#false} is VALID [2022-04-15 17:41:19,866 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-15 17:41:19,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:19,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490863603] [2022-04-15 17:41:19,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490863603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:19,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:19,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:41:19,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:19,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1535571812] [2022-04-15 17:41:19,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1535571812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:19,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:19,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:41:19,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778522597] [2022-04-15 17:41:19,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:19,871 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-04-15 17:41:19,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:19,871 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:41:19,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:19,889 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:41:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:19,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:41:19,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:41:19,890 INFO L87 Difference]: Start difference. First operand 228 states and 322 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:41:21,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:21,672 INFO L93 Difference]: Finished difference Result 401 states and 553 transitions. [2022-04-15 17:41:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:41:21,672 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-04-15 17:41:21,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:21,673 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:41:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 553 transitions. [2022-04-15 17:41:21,679 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:41:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 553 transitions. [2022-04-15 17:41:21,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 553 transitions. [2022-04-15 17:41:22,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 553 edges. 553 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:22,155 INFO L225 Difference]: With dead ends: 401 [2022-04-15 17:41:22,155 INFO L226 Difference]: Without dead ends: 343 [2022-04-15 17:41:22,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 17:41:22,157 INFO L913 BasicCegarLoop]: 352 mSDtfsCounter, 382 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:22,157 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [382 Valid, 462 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 17:41:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-04-15 17:41:22,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2022-04-15 17:41:22,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:22,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 343 states. Second operand has 301 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 240 states have internal predecessors, (330), 37 states have call successors, (37), 23 states have call predecessors, (37), 26 states have return successors, (44), 40 states have call predecessors, (44), 29 states have call successors, (44) [2022-04-15 17:41:22,185 INFO L74 IsIncluded]: Start isIncluded. First operand 343 states. Second operand has 301 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 240 states have internal predecessors, (330), 37 states have call successors, (37), 23 states have call predecessors, (37), 26 states have return successors, (44), 40 states have call predecessors, (44), 29 states have call successors, (44) [2022-04-15 17:41:22,186 INFO L87 Difference]: Start difference. First operand 343 states. Second operand has 301 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 240 states have internal predecessors, (330), 37 states have call successors, (37), 23 states have call predecessors, (37), 26 states have return successors, (44), 40 states have call predecessors, (44), 29 states have call successors, (44) [2022-04-15 17:41:22,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:22,198 INFO L93 Difference]: Finished difference Result 343 states and 469 transitions. [2022-04-15 17:41:22,198 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 469 transitions. [2022-04-15 17:41:22,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:22,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:22,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 240 states have internal predecessors, (330), 37 states have call successors, (37), 23 states have call predecessors, (37), 26 states have return successors, (44), 40 states have call predecessors, (44), 29 states have call successors, (44) Second operand 343 states. [2022-04-15 17:41:22,201 INFO L87 Difference]: Start difference. First operand has 301 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 240 states have internal predecessors, (330), 37 states have call successors, (37), 23 states have call predecessors, (37), 26 states have return successors, (44), 40 states have call predecessors, (44), 29 states have call successors, (44) Second operand 343 states. [2022-04-15 17:41:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:22,210 INFO L93 Difference]: Finished difference Result 343 states and 469 transitions. [2022-04-15 17:41:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 469 transitions. [2022-04-15 17:41:22,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:22,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:22,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:22,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 240 states have internal predecessors, (330), 37 states have call successors, (37), 23 states have call predecessors, (37), 26 states have return successors, (44), 40 states have call predecessors, (44), 29 states have call successors, (44) [2022-04-15 17:41:22,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2022-04-15 17:41:22,221 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 28 [2022-04-15 17:41:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:22,221 INFO L478 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2022-04-15 17:41:22,221 INFO L479 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, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:41:22,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 301 states and 411 transitions. [2022-04-15 17:41:22,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 411 edges. 411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2022-04-15 17:41:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 17:41:22,589 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:22,589 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:22,589 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 17:41:22,590 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:22,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1124228951, now seen corresponding path program 1 times [2022-04-15 17:41:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:22,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1256197010] [2022-04-15 17:41:22,591 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1124228951, now seen corresponding path program 2 times [2022-04-15 17:41:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:22,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986441357] [2022-04-15 17:41:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:22,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:22,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {4177#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {4165#true} is VALID [2022-04-15 17:41:22,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {4165#true} assume true; {4165#true} is VALID [2022-04-15 17:41:22,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4165#true} {4165#true} #780#return; {4165#true} is VALID [2022-04-15 17:41:22,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:22,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {4178#(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; {4165#true} is VALID [2022-04-15 17:41:22,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {4165#true} assume true; {4165#true} is VALID [2022-04-15 17:41:22,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4165#true} {4165#true} #714#return; {4165#true} is VALID [2022-04-15 17:41:22,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:22,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {4179#(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; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {4176#(= ~compRegistered~0 0)} assume true; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4176#(= ~compRegistered~0 0)} {4165#true} #716#return; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {4165#true} call ULTIMATE.init(); {4177#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:22,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {4177#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {4165#true} is VALID [2022-04-15 17:41:22,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {4165#true} assume true; {4165#true} is VALID [2022-04-15 17:41:22,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4165#true} {4165#true} #780#return; {4165#true} is VALID [2022-04-15 17:41:22,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {4165#true} call #t~ret83 := main(); {4165#true} is VALID [2022-04-15 17:41:22,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {4165#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;~DevicePowerState~0 := 1;~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; {4165#true} is VALID [2022-04-15 17:41:22,737 INFO L272 TraceCheckUtils]: 6: Hoare triple {4165#true} call _BLAST_init(); {4178#(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-15 17:41:22,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {4178#(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; {4165#true} is VALID [2022-04-15 17:41:22,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {4165#true} assume true; {4165#true} is VALID [2022-04-15 17:41:22,737 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {4165#true} {4165#true} #714#return; {4165#true} is VALID [2022-04-15 17:41:22,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {4165#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; {4165#true} is VALID [2022-04-15 17:41:22,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {4165#true} assume !(0 == ~irp_choice~0); {4165#true} is VALID [2022-04-15 17:41:22,738 INFO L272 TraceCheckUtils]: 12: Hoare triple {4165#true} call stub_driver_init(); {4179#(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-15 17:41:22,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {4179#(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; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {4176#(= ~compRegistered~0 0)} assume true; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,739 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4176#(= ~compRegistered~0 0)} {4165#true} #716#return; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {4176#(= ~compRegistered~0 0)} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {4176#(= ~compRegistered~0 0)} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {4176#(= ~compRegistered~0 0)} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {4176#(= ~compRegistered~0 0)} assume 3 == ~tmp_ndt_3~0; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,741 INFO L272 TraceCheckUtils]: 20: Hoare triple {4176#(= ~compRegistered~0 0)} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {4176#(= ~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; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {4176#(= ~compRegistered~0 0)} assume 0 == ~irpStack__MinorFunction~0; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {4176#(= ~compRegistered~0 0)} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {4176#(= ~compRegistered~0 0)} assume !(~s~0 != ~NP~0); {4176#(= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:22,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {4176#(= ~compRegistered~0 0)} assume 0 != ~compRegistered~0; {4166#false} is VALID [2022-04-15 17:41:22,743 INFO L272 TraceCheckUtils]: 26: Hoare triple {4166#false} call errorFn(); {4166#false} is VALID [2022-04-15 17:41:22,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {4166#false} assume !false; {4166#false} is VALID [2022-04-15 17:41:22,744 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-15 17:41:22,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:22,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986441357] [2022-04-15 17:41:22,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986441357] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:22,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:22,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:41:22,744 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:22,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1256197010] [2022-04-15 17:41:22,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1256197010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:22,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:22,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:41:22,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028156036] [2022-04-15 17:41:22,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:22,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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 28 [2022-04-15 17:41:22,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:22,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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-15 17:41:22,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:22,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:41:22,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:41:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:41:22,767 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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-15 17:41:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:24,285 INFO L93 Difference]: Finished difference Result 478 states and 635 transitions. [2022-04-15 17:41:24,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:41:24,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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 28 [2022-04-15 17:41:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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-15 17:41:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 503 transitions. [2022-04-15 17:41:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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-15 17:41:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 503 transitions. [2022-04-15 17:41:24,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 503 transitions. [2022-04-15 17:41:24,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 503 edges. 503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:24,691 INFO L225 Difference]: With dead ends: 478 [2022-04-15 17:41:24,691 INFO L226 Difference]: Without dead ends: 362 [2022-04-15 17:41:24,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-15 17:41:24,692 INFO L913 BasicCegarLoop]: 263 mSDtfsCounter, 404 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:24,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 379 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 17:41:24,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-04-15 17:41:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2022-04-15 17:41:24,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:24,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 362 states. Second operand has 341 states, 278 states have (on average 1.3848920863309353) internal successors, (385), 279 states have internal predecessors, (385), 33 states have call successors, (33), 23 states have call predecessors, (33), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-04-15 17:41:24,714 INFO L74 IsIncluded]: Start isIncluded. First operand 362 states. Second operand has 341 states, 278 states have (on average 1.3848920863309353) internal successors, (385), 279 states have internal predecessors, (385), 33 states have call successors, (33), 23 states have call predecessors, (33), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-04-15 17:41:24,715 INFO L87 Difference]: Start difference. First operand 362 states. Second operand has 341 states, 278 states have (on average 1.3848920863309353) internal successors, (385), 279 states have internal predecessors, (385), 33 states have call successors, (33), 23 states have call predecessors, (33), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-04-15 17:41:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:24,723 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-04-15 17:41:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 486 transitions. [2022-04-15 17:41:24,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:24,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:24,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 341 states, 278 states have (on average 1.3848920863309353) internal successors, (385), 279 states have internal predecessors, (385), 33 states have call successors, (33), 23 states have call predecessors, (33), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) Second operand 362 states. [2022-04-15 17:41:24,725 INFO L87 Difference]: Start difference. First operand has 341 states, 278 states have (on average 1.3848920863309353) internal successors, (385), 279 states have internal predecessors, (385), 33 states have call successors, (33), 23 states have call predecessors, (33), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) Second operand 362 states. [2022-04-15 17:41:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:24,733 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2022-04-15 17:41:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 486 transitions. [2022-04-15 17:41:24,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:24,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:24,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:24,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 278 states have (on average 1.3848920863309353) internal successors, (385), 279 states have internal predecessors, (385), 33 states have call successors, (33), 23 states have call predecessors, (33), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-04-15 17:41:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2022-04-15 17:41:24,743 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 28 [2022-04-15 17:41:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:24,743 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2022-04-15 17:41:24,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 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-15 17:41:24,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 341 states and 462 transitions. [2022-04-15 17:41:25,165 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-15 17:41:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2022-04-15 17:41:25,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 17:41:25,167 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:25,167 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:25,167 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 17:41:25,167 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:25,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash 512919532, now seen corresponding path program 1 times [2022-04-15 17:41:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:25,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1533209602] [2022-04-15 17:41:25,168 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash 512919532, now seen corresponding path program 2 times [2022-04-15 17:41:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:25,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353834243] [2022-04-15 17:41:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:25,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:25,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {6561#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {6549#true} is VALID [2022-04-15 17:41:25,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {6549#true} assume true; {6549#true} is VALID [2022-04-15 17:41:25,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6549#true} {6549#true} #780#return; {6549#true} is VALID [2022-04-15 17:41:25,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:25,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {6562#(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; {6549#true} is VALID [2022-04-15 17:41:25,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {6549#true} assume true; {6549#true} is VALID [2022-04-15 17:41:25,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6549#true} {6549#true} #714#return; {6549#true} is VALID [2022-04-15 17:41:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:25,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {6563#(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; {6549#true} is VALID [2022-04-15 17:41:25,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {6549#true} assume true; {6549#true} is VALID [2022-04-15 17:41:25,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6549#true} {6549#true} #716#return; {6549#true} is VALID [2022-04-15 17:41:25,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {6549#true} call ULTIMATE.init(); {6561#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:25,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {6561#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {6549#true} is VALID [2022-04-15 17:41:25,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {6549#true} assume true; {6549#true} is VALID [2022-04-15 17:41:25,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6549#true} {6549#true} #780#return; {6549#true} is VALID [2022-04-15 17:41:25,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {6549#true} call #t~ret83 := main(); {6549#true} is VALID [2022-04-15 17:41:25,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {6549#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;~DevicePowerState~0 := 1;~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; {6549#true} is VALID [2022-04-15 17:41:25,293 INFO L272 TraceCheckUtils]: 6: Hoare triple {6549#true} call _BLAST_init(); {6562#(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-15 17:41:25,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {6562#(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; {6549#true} is VALID [2022-04-15 17:41:25,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {6549#true} assume true; {6549#true} is VALID [2022-04-15 17:41:25,294 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {6549#true} {6549#true} #714#return; {6549#true} is VALID [2022-04-15 17:41:25,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {6549#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; {6549#true} is VALID [2022-04-15 17:41:25,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {6549#true} assume !(0 == ~irp_choice~0); {6549#true} is VALID [2022-04-15 17:41:25,304 INFO L272 TraceCheckUtils]: 12: Hoare triple {6549#true} call stub_driver_init(); {6563#(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-15 17:41:25,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {6563#(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; {6549#true} is VALID [2022-04-15 17:41:25,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {6549#true} assume true; {6549#true} is VALID [2022-04-15 17:41:25,304 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6549#true} {6549#true} #716#return; {6549#true} is VALID [2022-04-15 17:41:25,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {6549#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {6549#true} is VALID [2022-04-15 17:41:25,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {6549#true} assume 0 == ~tmp_ndt_1~0; {6549#true} is VALID [2022-04-15 17:41:25,305 INFO L272 TraceCheckUtils]: 18: Hoare triple {6549#true} call #t~ret31 := KbFilter_CreateClose(~devobj~0, ~pirp~0); {6549#true} is VALID [2022-04-15 17:41:25,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {6549#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;assume -2147483648 <= #t~nondet43 && #t~nondet43 <= 2147483647;~irpStack__MajorFunction~0 := #t~nondet43;havoc #t~nondet43;assume -2147483648 <= #t~nondet44 && #t~nondet44 <= 2147483647;~devExt__UpperConnectData__ClassService~0 := #t~nondet44;havoc #t~nondet44;havoc ~Irp__IoStatus__Status~1;havoc ~status~2;havoc ~tmp~0;~status~2 := ~myStatus~0; {6549#true} is VALID [2022-04-15 17:41:25,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {6549#true} assume 0 == ~irpStack__MajorFunction~0; {6549#true} is VALID [2022-04-15 17:41:25,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {6549#true} assume 0 == ~devExt__UpperConnectData__ClassService~0;~status~2 := -1073741436; {6549#true} is VALID [2022-04-15 17:41:25,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {6549#true} ~Irp__IoStatus__Status~1 := ~status~2;~myStatus~0 := ~status~2; {6549#true} is VALID [2022-04-15 17:41:25,306 INFO L272 TraceCheckUtils]: 23: Hoare triple {6549#true} call #t~ret45 := KbFilter_DispatchPassThrough(~DeviceObject, ~Irp); {6549#true} is VALID [2022-04-15 17:41:25,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {6549#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;assume -2147483648 <= #t~nondet46 && #t~nondet46 <= 2147483647;~Irp__Tail__Overlay__CurrentStackLocation~1 := #t~nondet46;havoc #t~nondet46;assume -2147483648 <= #t~nondet47 && #t~nondet47 <= 2147483647;~Irp__CurrentLocation~1 := #t~nondet47;havoc #t~nondet47;assume -2147483648 <= #t~nondet48 && #t~nondet48 <= 2147483647;~DeviceObject__DeviceExtension__TopOfStack~0 := #t~nondet48;havoc #t~nondet48;havoc ~irpStack~1;havoc ~tmp~1;~irpStack~1 := ~Irp__Tail__Overlay__CurrentStackLocation~1; {6549#true} is VALID [2022-04-15 17:41:25,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {6549#true} assume ~s~0 == ~NP~0;~s~0 := ~SKIP1~0; {6560#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 17:41:25,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {6560#(= ~SKIP1~0 ~s~0)} #t~post49 := ~Irp__CurrentLocation~1;~Irp__CurrentLocation~1 := 1 + #t~post49;havoc #t~post49;#t~post50 := ~Irp__Tail__Overlay__CurrentStackLocation~1;~Irp__Tail__Overlay__CurrentStackLocation~1 := 1 + #t~post50;havoc #t~post50; {6560#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 17:41:25,307 INFO L272 TraceCheckUtils]: 27: Hoare triple {6560#(= ~SKIP1~0 ~s~0)} call #t~ret51 := IofCallDriver(~DeviceObject__DeviceExtension__TopOfStack~0, ~Irp); {6560#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 17:41:25,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {6560#(= ~SKIP1~0 ~s~0)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {6560#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 17:41:25,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {6560#(= ~SKIP1~0 ~s~0)} assume !(0 != ~compRegistered~0); {6560#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 17:41:25,309 INFO L290 TraceCheckUtils]: 30: Hoare triple {6560#(= ~SKIP1~0 ~s~0)} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {6560#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 17:41:25,309 INFO L290 TraceCheckUtils]: 31: Hoare triple {6560#(= ~SKIP1~0 ~s~0)} assume 0 == ~tmp_ndt_6~0; {6560#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 17:41:25,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {6560#(= ~SKIP1~0 ~s~0)} ~returnVal2~0 := 0; {6560#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 17:41:25,310 INFO L290 TraceCheckUtils]: 33: Hoare triple {6560#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~NP~0); {6560#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 17:41:25,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {6560#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~MPR1~0); {6560#(= ~SKIP1~0 ~s~0)} is VALID [2022-04-15 17:41:25,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {6560#(= ~SKIP1~0 ~s~0)} assume !(~s~0 == ~SKIP1~0); {6550#false} is VALID [2022-04-15 17:41:25,310 INFO L272 TraceCheckUtils]: 36: Hoare triple {6550#false} call errorFn(); {6550#false} is VALID [2022-04-15 17:41:25,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {6550#false} assume !false; {6550#false} is VALID [2022-04-15 17:41:25,311 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-15 17:41:25,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:25,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353834243] [2022-04-15 17:41:25,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353834243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:25,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:25,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:41:25,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:25,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1533209602] [2022-04-15 17:41:25,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1533209602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:25,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:25,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:41:25,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410697847] [2022-04-15 17:41:25,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:25,313 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-04-15 17:41:25,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:25,314 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:41:25,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:25,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:41:25,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:25,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:41:25,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:41:25,336 INFO L87 Difference]: Start difference. First operand 341 states and 462 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:41:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:26,549 INFO L93 Difference]: Finished difference Result 344 states and 464 transitions. [2022-04-15 17:41:26,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 17:41:26,549 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-04-15 17:41:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:26,550 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:41:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 334 transitions. [2022-04-15 17:41:26,552 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:41:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 334 transitions. [2022-04-15 17:41:26,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 334 transitions. [2022-04-15 17:41:26,830 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-15 17:41:26,837 INFO L225 Difference]: With dead ends: 344 [2022-04-15 17:41:26,837 INFO L226 Difference]: Without dead ends: 340 [2022-04-15 17:41:26,837 INFO L912 BasicCegarLoop]: 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-15 17:41:26,838 INFO L913 BasicCegarLoop]: 264 mSDtfsCounter, 341 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:26,838 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 413 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 17:41:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-04-15 17:41:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-04-15 17:41:26,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:26,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 340 states. Second operand has 340 states, 278 states have (on average 1.3776978417266188) internal successors, (383), 278 states have internal predecessors, (383), 32 states have call successors, (32), 23 states have call predecessors, (32), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-04-15 17:41:26,857 INFO L74 IsIncluded]: Start isIncluded. First operand 340 states. Second operand has 340 states, 278 states have (on average 1.3776978417266188) internal successors, (383), 278 states have internal predecessors, (383), 32 states have call successors, (32), 23 states have call predecessors, (32), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-04-15 17:41:26,858 INFO L87 Difference]: Start difference. First operand 340 states. Second operand has 340 states, 278 states have (on average 1.3776978417266188) internal successors, (383), 278 states have internal predecessors, (383), 32 states have call successors, (32), 23 states have call predecessors, (32), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-04-15 17:41:26,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:26,864 INFO L93 Difference]: Finished difference Result 340 states and 459 transitions. [2022-04-15 17:41:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2022-04-15 17:41:26,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:26,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:26,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 340 states, 278 states have (on average 1.3776978417266188) internal successors, (383), 278 states have internal predecessors, (383), 32 states have call successors, (32), 23 states have call predecessors, (32), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) Second operand 340 states. [2022-04-15 17:41:26,866 INFO L87 Difference]: Start difference. First operand has 340 states, 278 states have (on average 1.3776978417266188) internal successors, (383), 278 states have internal predecessors, (383), 32 states have call successors, (32), 23 states have call predecessors, (32), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) Second operand 340 states. [2022-04-15 17:41:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:26,872 INFO L93 Difference]: Finished difference Result 340 states and 459 transitions. [2022-04-15 17:41:26,873 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2022-04-15 17:41:26,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:26,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:26,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:26,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 278 states have (on average 1.3776978417266188) internal successors, (383), 278 states have internal predecessors, (383), 32 states have call successors, (32), 23 states have call predecessors, (32), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2022-04-15 17:41:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2022-04-15 17:41:26,881 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 38 [2022-04-15 17:41:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:26,881 INFO L478 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2022-04-15 17:41:26,881 INFO L479 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, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 17:41:26,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 340 states and 459 transitions. [2022-04-15 17:41:27,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2022-04-15 17:41:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 17:41:27,319 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:27,319 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:27,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 17:41:27,319 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:27,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash 708737618, now seen corresponding path program 1 times [2022-04-15 17:41:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:27,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1117899482] [2022-04-15 17:41:27,320 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash 708737618, now seen corresponding path program 2 times [2022-04-15 17:41:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:27,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436829322] [2022-04-15 17:41:27,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:27,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:27,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {8638#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {8617#true} is VALID [2022-04-15 17:41:27,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {8617#true} assume true; {8617#true} is VALID [2022-04-15 17:41:27,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8617#true} {8617#true} #780#return; {8617#true} is VALID [2022-04-15 17:41:27,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:27,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {8639#(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; {8617#true} is VALID [2022-04-15 17:41:27,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {8617#true} assume true; {8617#true} is VALID [2022-04-15 17:41:27,423 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8617#true} {8617#true} #714#return; {8617#true} is VALID [2022-04-15 17:41:27,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:27,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {8640#(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; {8617#true} is VALID [2022-04-15 17:41:27,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {8617#true} assume true; {8617#true} is VALID [2022-04-15 17:41:27,435 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8617#true} {8617#true} #716#return; {8617#true} is VALID [2022-04-15 17:41:27,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 17:41:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:27,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {8641#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {8617#true} is VALID [2022-04-15 17:41:27,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {8617#true} assume !(0 != ~compRegistered~0); {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {8642#(<= ~compRegistered~0 0)} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {8642#(<= ~compRegistered~0 0)} assume 0 == ~tmp_ndt_6~0; {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,457 INFO L290 TraceCheckUtils]: 4: Hoare triple {8642#(<= ~compRegistered~0 0)} ~returnVal2~0 := 0; {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {8642#(<= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {8642#(<= ~compRegistered~0 0)} #res := ~returnVal2~0; {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {8642#(<= ~compRegistered~0 0)} assume true; {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,459 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {8642#(<= ~compRegistered~0 0)} {8628#(= ~compRegistered~0 1)} #752#return; {8618#false} is VALID [2022-04-15 17:41:27,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {8617#true} call ULTIMATE.init(); {8638#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:27,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {8638#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {8617#true} is VALID [2022-04-15 17:41:27,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {8617#true} assume true; {8617#true} is VALID [2022-04-15 17:41:27,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8617#true} {8617#true} #780#return; {8617#true} is VALID [2022-04-15 17:41:27,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {8617#true} call #t~ret83 := main(); {8617#true} is VALID [2022-04-15 17:41:27,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {8617#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;~DevicePowerState~0 := 1;~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; {8617#true} is VALID [2022-04-15 17:41:27,462 INFO L272 TraceCheckUtils]: 6: Hoare triple {8617#true} call _BLAST_init(); {8639#(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-15 17:41:27,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {8639#(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; {8617#true} is VALID [2022-04-15 17:41:27,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {8617#true} assume true; {8617#true} is VALID [2022-04-15 17:41:27,462 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {8617#true} {8617#true} #714#return; {8617#true} is VALID [2022-04-15 17:41:27,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {8617#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; {8617#true} is VALID [2022-04-15 17:41:27,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {8617#true} assume !(0 == ~irp_choice~0); {8617#true} is VALID [2022-04-15 17:41:27,463 INFO L272 TraceCheckUtils]: 12: Hoare triple {8617#true} call stub_driver_init(); {8640#(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-15 17:41:27,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {8640#(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; {8617#true} is VALID [2022-04-15 17:41:27,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {8617#true} assume true; {8617#true} is VALID [2022-04-15 17:41:27,463 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8617#true} {8617#true} #716#return; {8617#true} is VALID [2022-04-15 17:41:27,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {8617#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {8617#true} is VALID [2022-04-15 17:41:27,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {8617#true} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {8617#true} is VALID [2022-04-15 17:41:27,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {8617#true} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {8617#true} is VALID [2022-04-15 17:41:27,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {8617#true} assume 3 == ~tmp_ndt_3~0; {8617#true} is VALID [2022-04-15 17:41:27,463 INFO L272 TraceCheckUtils]: 20: Hoare triple {8617#true} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {8617#true} is VALID [2022-04-15 17:41:27,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {8617#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; {8617#true} is VALID [2022-04-15 17:41:27,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {8617#true} assume 0 == ~irpStack__MinorFunction~0; {8617#true} is VALID [2022-04-15 17:41:27,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {8617#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {8617#true} is VALID [2022-04-15 17:41:27,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {8617#true} assume !(~s~0 != ~NP~0); {8617#true} is VALID [2022-04-15 17:41:27,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {8617#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {8628#(= ~compRegistered~0 1)} is VALID [2022-04-15 17:41:27,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {8628#(= ~compRegistered~0 1)} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {8628#(= ~compRegistered~0 1)} is VALID [2022-04-15 17:41:27,466 INFO L272 TraceCheckUtils]: 27: Hoare triple {8628#(= ~compRegistered~0 1)} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {8641#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:27,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {8641#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {8617#true} is VALID [2022-04-15 17:41:27,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {8617#true} assume !(0 != ~compRegistered~0); {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {8642#(<= ~compRegistered~0 0)} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {8642#(<= ~compRegistered~0 0)} assume 0 == ~tmp_ndt_6~0; {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {8642#(<= ~compRegistered~0 0)} ~returnVal2~0 := 0; {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {8642#(<= ~compRegistered~0 0)} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {8642#(<= ~compRegistered~0 0)} #res := ~returnVal2~0; {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {8642#(<= ~compRegistered~0 0)} assume true; {8642#(<= ~compRegistered~0 0)} is VALID [2022-04-15 17:41:27,471 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8642#(<= ~compRegistered~0 0)} {8628#(= ~compRegistered~0 1)} #752#return; {8618#false} is VALID [2022-04-15 17:41:27,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {8618#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {8618#false} is VALID [2022-04-15 17:41:27,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {8618#false} assume 259 == ~__cil_tmp23~0; {8618#false} is VALID [2022-04-15 17:41:27,472 INFO L272 TraceCheckUtils]: 39: Hoare triple {8618#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {8618#false} is VALID [2022-04-15 17:41:27,472 INFO L290 TraceCheckUtils]: 40: Hoare triple {8618#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {8618#false} is VALID [2022-04-15 17:41:27,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {8618#false} assume !(~s~0 == ~MPR3~0); {8618#false} is VALID [2022-04-15 17:41:27,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {8618#false} assume !(1 == ~customIrp~0); {8618#false} is VALID [2022-04-15 17:41:27,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {8618#false} assume ~s~0 == ~MPR3~0; {8618#false} is VALID [2022-04-15 17:41:27,472 INFO L272 TraceCheckUtils]: 44: Hoare triple {8618#false} call errorFn(); {8618#false} is VALID [2022-04-15 17:41:27,472 INFO L290 TraceCheckUtils]: 45: Hoare triple {8618#false} assume !false; {8618#false} is VALID [2022-04-15 17:41:27,473 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-15 17:41:27,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:27,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436829322] [2022-04-15 17:41:27,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436829322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:27,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:27,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 17:41:27,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:27,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1117899482] [2022-04-15 17:41:27,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1117899482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:27,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:27,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 17:41:27,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528503040] [2022-04-15 17:41:27,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:27,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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 46 [2022-04-15 17:41:27,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:27,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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-15 17:41:27,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:27,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 17:41:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:27,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 17:41:27,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-15 17:41:27,501 INFO L87 Difference]: Start difference. First operand 340 states and 459 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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-15 17:41:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:28,937 INFO L93 Difference]: Finished difference Result 385 states and 508 transitions. [2022-04-15 17:41:28,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 17:41:28,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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 46 [2022-04-15 17:41:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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-15 17:41:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 413 transitions. [2022-04-15 17:41:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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-15 17:41:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 413 transitions. [2022-04-15 17:41:28,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 413 transitions. [2022-04-15 17:41:29,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 413 edges. 413 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:29,284 INFO L225 Difference]: With dead ends: 385 [2022-04-15 17:41:29,284 INFO L226 Difference]: Without dead ends: 319 [2022-04-15 17:41:29,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:41:29,285 INFO L913 BasicCegarLoop]: 298 mSDtfsCounter, 746 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:29,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [746 Valid, 518 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 17:41:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-15 17:41:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2022-04-15 17:41:29,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:29,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 301 states, 244 states have (on average 1.3688524590163935) internal successors, (334), 244 states have internal predecessors, (334), 29 states have call successors, (29), 21 states have call predecessors, (29), 27 states have return successors, (39), 36 states have call predecessors, (39), 24 states have call successors, (39) [2022-04-15 17:41:29,399 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 301 states, 244 states have (on average 1.3688524590163935) internal successors, (334), 244 states have internal predecessors, (334), 29 states have call successors, (29), 21 states have call predecessors, (29), 27 states have return successors, (39), 36 states have call predecessors, (39), 24 states have call successors, (39) [2022-04-15 17:41:29,399 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 301 states, 244 states have (on average 1.3688524590163935) internal successors, (334), 244 states have internal predecessors, (334), 29 states have call successors, (29), 21 states have call predecessors, (29), 27 states have return successors, (39), 36 states have call predecessors, (39), 24 states have call successors, (39) [2022-04-15 17:41:29,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:29,405 INFO L93 Difference]: Finished difference Result 319 states and 423 transitions. [2022-04-15 17:41:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 423 transitions. [2022-04-15 17:41:29,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:29,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:29,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 244 states have (on average 1.3688524590163935) internal successors, (334), 244 states have internal predecessors, (334), 29 states have call successors, (29), 21 states have call predecessors, (29), 27 states have return successors, (39), 36 states have call predecessors, (39), 24 states have call successors, (39) Second operand 319 states. [2022-04-15 17:41:29,407 INFO L87 Difference]: Start difference. First operand has 301 states, 244 states have (on average 1.3688524590163935) internal successors, (334), 244 states have internal predecessors, (334), 29 states have call successors, (29), 21 states have call predecessors, (29), 27 states have return successors, (39), 36 states have call predecessors, (39), 24 states have call successors, (39) Second operand 319 states. [2022-04-15 17:41:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:29,413 INFO L93 Difference]: Finished difference Result 319 states and 423 transitions. [2022-04-15 17:41:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 423 transitions. [2022-04-15 17:41:29,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:29,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:29,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:29,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 244 states have (on average 1.3688524590163935) internal successors, (334), 244 states have internal predecessors, (334), 29 states have call successors, (29), 21 states have call predecessors, (29), 27 states have return successors, (39), 36 states have call predecessors, (39), 24 states have call successors, (39) [2022-04-15 17:41:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions. [2022-04-15 17:41:29,420 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 46 [2022-04-15 17:41:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:29,420 INFO L478 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions. [2022-04-15 17:41:29,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 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-15 17:41:29,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 301 states and 402 transitions. [2022-04-15 17:41:29,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2022-04-15 17:41:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 17:41:29,814 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:29,814 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:29,814 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 17:41:29,814 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:29,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1153649594, now seen corresponding path program 1 times [2022-04-15 17:41:29,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:29,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [777344954] [2022-04-15 17:41:29,815 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:29,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1153649594, now seen corresponding path program 2 times [2022-04-15 17:41:29,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:29,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114109740] [2022-04-15 17:41:29,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:29,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:29,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:29,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {10690#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {10665#true} is VALID [2022-04-15 17:41:29,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-15 17:41:29,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10665#true} {10665#true} #780#return; {10665#true} is VALID [2022-04-15 17:41:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:29,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {10691#(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; {10692#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 17:41:29,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {10692#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} assume true; {10692#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 17:41:29,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10692#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} {10665#true} #714#return; {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 17:41:29,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:29,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {10693#(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; {10665#true} is VALID [2022-04-15 17:41:29,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-15 17:41:29,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10665#true} {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} #716#return; {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 17:41:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 17:41:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:30,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-15 17:41:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:30,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {10700#(= ~s~0 |old(~s~0)|)} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {10665#true} is VALID [2022-04-15 17:41:30,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {10665#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {10701#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 17:41:30,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {10701#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} assume true; {10701#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 17:41:30,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10701#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} {10665#true} #740#return; {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:30,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {10694#(and (= ~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 ~Irp__IoStatus__Information~1;assume -2147483648 <= #t~nondet65 && #t~nondet65 <= 2147483647;~irpStack__Parameters__DeviceIoControl__IoControlCode~0 := #t~nondet65;havoc #t~nondet65;assume -2147483648 <= #t~nondet66 && #t~nondet66 <= 2147483647;~devExt__UpperConnectData__ClassService~1 := #t~nondet66;havoc #t~nondet66;assume -2147483648 <= #t~nondet67 && #t~nondet67 <= 2147483647;~irpStack__Parameters__DeviceIoControl__InputBufferLength~0 := #t~nondet67;havoc #t~nondet67;assume -2147483648 <= #t~nondet68 && #t~nondet68 <= 2147483647;~sizeof__CONNECT_DATA~0 := #t~nondet68;havoc #t~nondet68;assume -2147483648 <= #t~nondet69 && #t~nondet69 <= 2147483647;~irpStack__Parameters__DeviceIoControl__Type3InputBuffer~0 := #t~nondet69;havoc #t~nondet69;assume -2147483648 <= #t~nondet70 && #t~nondet70 <= 2147483647;~sizeof__INTERNAL_I8042_HOOK_KEYBOARD~0 := #t~nondet70;havoc #t~nondet70;assume -2147483648 <= #t~nondet71 && #t~nondet71 <= 2147483647;~hookKeyboard__InitializationRoutine~0 := #t~nondet71;havoc #t~nondet71;assume -2147483648 <= #t~nondet72 && #t~nondet72 <= 2147483647;~hookKeyboard__IsrRoutine~0 := #t~nondet72;havoc #t~nondet72;havoc ~Irp__IoStatus__Status~2;havoc ~hookKeyboard~0;havoc ~connectData~0;havoc ~status~3;havoc ~tmp~3;havoc ~__cil_tmp17~0;havoc ~__cil_tmp18~0;havoc ~__cil_tmp19~0;assume -2147483648 <= #t~nondet73 && #t~nondet73 <= 2147483647;~__cil_tmp20~0 := #t~nondet73;havoc #t~nondet73;havoc ~__cil_tmp21~0;havoc ~__cil_tmp22~0;havoc ~__cil_tmp23~1;assume -2147483648 <= #t~nondet74 && #t~nondet74 <= 2147483647;~__cil_tmp24~0 := #t~nondet74;havoc #t~nondet74;havoc ~__cil_tmp25~0;havoc ~__cil_tmp26~0;havoc ~__cil_tmp27~0;assume -2147483648 <= #t~nondet75 && #t~nondet75 <= 2147483647;~__cil_tmp28~0 := #t~nondet75;havoc #t~nondet75;assume -2147483648 <= #t~nondet76 && #t~nondet76 <= 2147483647;~__cil_tmp29~0 := #t~nondet76;havoc #t~nondet76;havoc ~__cil_tmp30~0;havoc ~__cil_tmp31~0;assume -2147483648 <= #t~nondet77 && #t~nondet77 <= 2147483647;~__cil_tmp32~0 := #t~nondet77;havoc #t~nondet77;havoc ~__cil_tmp33~0;havoc ~__cil_tmp34~0;assume -2147483648 <= #t~nondet78 && #t~nondet78 <= 2147483647;~__cil_tmp35~0 := #t~nondet78;havoc #t~nondet78;havoc ~__cil_tmp36~0;havoc ~__cil_tmp37~0;assume -2147483648 <= #t~nondet79 && #t~nondet79 <= 2147483647;~__cil_tmp38~0 := #t~nondet79;havoc #t~nondet79;havoc ~__cil_tmp39~0;havoc ~__cil_tmp40~0;assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~__cil_tmp41~0 := #t~nondet80;havoc #t~nondet80;havoc ~__cil_tmp42~0;havoc ~__cil_tmp43~0;assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~__cil_tmp44~0 := #t~nondet81;havoc #t~nondet81;havoc ~__cil_tmp45~0;~status~3 := 0;~Irp__IoStatus__Information~1 := 0; {10665#true} is VALID [2022-04-15 17:41:30,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {10665#true} assume ~irpStack__Parameters__DeviceIoControl__IoControlCode~0 == ~__cil_tmp20~0; {10665#true} is VALID [2022-04-15 17:41:30,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {10665#true} assume 0 != ~devExt__UpperConnectData__ClassService~1;~status~3 := -1073741757; {10665#true} is VALID [2022-04-15 17:41:30,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {10665#true} assume ~status~3 < 0;~Irp__IoStatus__Status~2 := ~status~3;~myStatus~0 := ~status~3; {10665#true} is VALID [2022-04-15 17:41:30,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {10665#true} call IofCompleteRequest(~Irp, 0); {10700#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:30,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {10700#(= ~s~0 |old(~s~0)|)} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {10665#true} is VALID [2022-04-15 17:41:30,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {10665#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {10701#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 17:41:30,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {10701#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} assume true; {10701#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 17:41:30,075 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {10701#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} {10665#true} #740#return; {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:30,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} #res := ~status~3; {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:30,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} assume true; {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:30,076 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} #726#return; {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 17:41:30,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {10665#true} call ULTIMATE.init(); {10690#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:30,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {10690#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {10665#true} is VALID [2022-04-15 17:41:30,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-15 17:41:30,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10665#true} {10665#true} #780#return; {10665#true} is VALID [2022-04-15 17:41:30,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {10665#true} call #t~ret83 := main(); {10665#true} is VALID [2022-04-15 17:41:30,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {10665#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;~DevicePowerState~0 := 1;~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; {10665#true} is VALID [2022-04-15 17:41:30,082 INFO L272 TraceCheckUtils]: 6: Hoare triple {10665#true} call _BLAST_init(); {10691#(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-15 17:41:30,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {10691#(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; {10692#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 17:41:30,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {10692#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} assume true; {10692#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} is VALID [2022-04-15 17:41:30,085 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {10692#(and (= (+ (- 2) ~DC~0) 0) (<= 4 ~SKIP2~0))} {10665#true} #714#return; {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 17:41:30,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~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; {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 17:41:30,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume !(0 == ~irp_choice~0); {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 17:41:30,090 INFO L272 TraceCheckUtils]: 12: Hoare triple {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} call stub_driver_init(); {10693#(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-15 17:41:30,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {10693#(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; {10665#true} is VALID [2022-04-15 17:41:30,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {10665#true} assume true; {10665#true} is VALID [2022-04-15 17:41:30,090 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10665#true} {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} #716#return; {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 17:41:30,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 17:41:30,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 17:41:30,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 17:41:30,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume !(3 == ~tmp_ndt_3~0);havoc ~tmp_ndt_4~0;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp_ndt_4~0 := #t~nondet29;havoc #t~nondet29; {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 17:41:30,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume !(4 == ~tmp_ndt_4~0);havoc ~tmp_ndt_5~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_5~0 := #t~nondet30;havoc #t~nondet30; {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 17:41:30,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} assume 8 == ~tmp_ndt_5~0; {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} is VALID [2022-04-15 17:41:30,096 INFO L272 TraceCheckUtils]: 22: Hoare triple {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} call #t~ret35 := KbFilter_InternIoCtl(~devobj~0, ~pirp~0); {10694#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:30,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {10694#(and (= ~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 ~Irp__IoStatus__Information~1;assume -2147483648 <= #t~nondet65 && #t~nondet65 <= 2147483647;~irpStack__Parameters__DeviceIoControl__IoControlCode~0 := #t~nondet65;havoc #t~nondet65;assume -2147483648 <= #t~nondet66 && #t~nondet66 <= 2147483647;~devExt__UpperConnectData__ClassService~1 := #t~nondet66;havoc #t~nondet66;assume -2147483648 <= #t~nondet67 && #t~nondet67 <= 2147483647;~irpStack__Parameters__DeviceIoControl__InputBufferLength~0 := #t~nondet67;havoc #t~nondet67;assume -2147483648 <= #t~nondet68 && #t~nondet68 <= 2147483647;~sizeof__CONNECT_DATA~0 := #t~nondet68;havoc #t~nondet68;assume -2147483648 <= #t~nondet69 && #t~nondet69 <= 2147483647;~irpStack__Parameters__DeviceIoControl__Type3InputBuffer~0 := #t~nondet69;havoc #t~nondet69;assume -2147483648 <= #t~nondet70 && #t~nondet70 <= 2147483647;~sizeof__INTERNAL_I8042_HOOK_KEYBOARD~0 := #t~nondet70;havoc #t~nondet70;assume -2147483648 <= #t~nondet71 && #t~nondet71 <= 2147483647;~hookKeyboard__InitializationRoutine~0 := #t~nondet71;havoc #t~nondet71;assume -2147483648 <= #t~nondet72 && #t~nondet72 <= 2147483647;~hookKeyboard__IsrRoutine~0 := #t~nondet72;havoc #t~nondet72;havoc ~Irp__IoStatus__Status~2;havoc ~hookKeyboard~0;havoc ~connectData~0;havoc ~status~3;havoc ~tmp~3;havoc ~__cil_tmp17~0;havoc ~__cil_tmp18~0;havoc ~__cil_tmp19~0;assume -2147483648 <= #t~nondet73 && #t~nondet73 <= 2147483647;~__cil_tmp20~0 := #t~nondet73;havoc #t~nondet73;havoc ~__cil_tmp21~0;havoc ~__cil_tmp22~0;havoc ~__cil_tmp23~1;assume -2147483648 <= #t~nondet74 && #t~nondet74 <= 2147483647;~__cil_tmp24~0 := #t~nondet74;havoc #t~nondet74;havoc ~__cil_tmp25~0;havoc ~__cil_tmp26~0;havoc ~__cil_tmp27~0;assume -2147483648 <= #t~nondet75 && #t~nondet75 <= 2147483647;~__cil_tmp28~0 := #t~nondet75;havoc #t~nondet75;assume -2147483648 <= #t~nondet76 && #t~nondet76 <= 2147483647;~__cil_tmp29~0 := #t~nondet76;havoc #t~nondet76;havoc ~__cil_tmp30~0;havoc ~__cil_tmp31~0;assume -2147483648 <= #t~nondet77 && #t~nondet77 <= 2147483647;~__cil_tmp32~0 := #t~nondet77;havoc #t~nondet77;havoc ~__cil_tmp33~0;havoc ~__cil_tmp34~0;assume -2147483648 <= #t~nondet78 && #t~nondet78 <= 2147483647;~__cil_tmp35~0 := #t~nondet78;havoc #t~nondet78;havoc ~__cil_tmp36~0;havoc ~__cil_tmp37~0;assume -2147483648 <= #t~nondet79 && #t~nondet79 <= 2147483647;~__cil_tmp38~0 := #t~nondet79;havoc #t~nondet79;havoc ~__cil_tmp39~0;havoc ~__cil_tmp40~0;assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~__cil_tmp41~0 := #t~nondet80;havoc #t~nondet80;havoc ~__cil_tmp42~0;havoc ~__cil_tmp43~0;assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~__cil_tmp44~0 := #t~nondet81;havoc #t~nondet81;havoc ~__cil_tmp45~0;~status~3 := 0;~Irp__IoStatus__Information~1 := 0; {10665#true} is VALID [2022-04-15 17:41:30,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {10665#true} assume ~irpStack__Parameters__DeviceIoControl__IoControlCode~0 == ~__cil_tmp20~0; {10665#true} is VALID [2022-04-15 17:41:30,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {10665#true} assume 0 != ~devExt__UpperConnectData__ClassService~1;~status~3 := -1073741757; {10665#true} is VALID [2022-04-15 17:41:30,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {10665#true} assume ~status~3 < 0;~Irp__IoStatus__Status~2 := ~status~3;~myStatus~0 := ~status~3; {10665#true} is VALID [2022-04-15 17:41:30,097 INFO L272 TraceCheckUtils]: 27: Hoare triple {10665#true} call IofCompleteRequest(~Irp, 0); {10700#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:30,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {10700#(= ~s~0 |old(~s~0)|)} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {10665#true} is VALID [2022-04-15 17:41:30,097 INFO L290 TraceCheckUtils]: 29: Hoare triple {10665#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {10701#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 17:41:30,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {10701#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} assume true; {10701#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 17:41:30,098 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10701#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} {10665#true} #740#return; {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:30,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} #res := ~status~3; {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:30,099 INFO L290 TraceCheckUtils]: 33: Hoare triple {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} assume true; {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:30,100 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {10699#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} {10673#(and (not (= ~SKIP2~0 2)) (= 2 ~DC~0))} #726#return; {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 17:41:30,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;~status~1 := #t~ret35;havoc #t~ret35; {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 17:41:30,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume !(1 == ~pended~0); {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 17:41:30,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume !(1 == ~pended~0); {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 17:41:30,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume ~s~0 != ~UNLOADED~0; {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 17:41:30,102 INFO L290 TraceCheckUtils]: 39: Hoare triple {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume -1 != ~status~1; {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} is VALID [2022-04-15 17:41:30,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {10689#(and (not (= ~SKIP2~0 2)) (= 2 ~s~0))} assume !(~s~0 != ~SKIP2~0); {10666#false} is VALID [2022-04-15 17:41:30,102 INFO L290 TraceCheckUtils]: 41: Hoare triple {10666#false} assume 1 == ~pended~0; {10666#false} is VALID [2022-04-15 17:41:30,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {10666#false} assume 259 != ~status~1; {10666#false} is VALID [2022-04-15 17:41:30,102 INFO L272 TraceCheckUtils]: 43: Hoare triple {10666#false} call errorFn(); {10666#false} is VALID [2022-04-15 17:41:30,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {10666#false} assume !false; {10666#false} is VALID [2022-04-15 17:41:30,103 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-15 17:41:30,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:30,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114109740] [2022-04-15 17:41:30,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114109740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:30,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:30,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:41:30,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:30,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [777344954] [2022-04-15 17:41:30,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [777344954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:30,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:30,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:41:30,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387223062] [2022-04-15 17:41:30,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:30,105 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2022-04-15 17:41:30,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:30,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 17:41:30,138 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-15 17:41:30,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 17:41:30,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:30,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 17:41:30,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:41:30,139 INFO L87 Difference]: Start difference. First operand 301 states and 402 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 17:41:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:33,090 INFO L93 Difference]: Finished difference Result 327 states and 430 transitions. [2022-04-15 17:41:33,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 17:41:33,091 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2022-04-15 17:41:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 17:41:33,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 355 transitions. [2022-04-15 17:41:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 17:41:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 355 transitions. [2022-04-15 17:41:33,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 355 transitions. [2022-04-15 17:41:33,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:33,455 INFO L225 Difference]: With dead ends: 327 [2022-04-15 17:41:33,455 INFO L226 Difference]: Without dead ends: 322 [2022-04-15 17:41:33,455 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-04-15 17:41:33,456 INFO L913 BasicCegarLoop]: 252 mSDtfsCounter, 1050 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:33,456 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1052 Valid, 608 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 17:41:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-15 17:41:33,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 315. [2022-04-15 17:41:33,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:33,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 315 states, 256 states have (on average 1.359375) internal successors, (348), 255 states have internal predecessors, (348), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-04-15 17:41:33,669 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 315 states, 256 states have (on average 1.359375) internal successors, (348), 255 states have internal predecessors, (348), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-04-15 17:41:33,670 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 315 states, 256 states have (on average 1.359375) internal successors, (348), 255 states have internal predecessors, (348), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-04-15 17:41:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:33,676 INFO L93 Difference]: Finished difference Result 322 states and 425 transitions. [2022-04-15 17:41:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 425 transitions. [2022-04-15 17:41:33,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:33,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:33,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 315 states, 256 states have (on average 1.359375) internal successors, (348), 255 states have internal predecessors, (348), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) Second operand 322 states. [2022-04-15 17:41:33,677 INFO L87 Difference]: Start difference. First operand has 315 states, 256 states have (on average 1.359375) internal successors, (348), 255 states have internal predecessors, (348), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) Second operand 322 states. [2022-04-15 17:41:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:33,683 INFO L93 Difference]: Finished difference Result 322 states and 425 transitions. [2022-04-15 17:41:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 425 transitions. [2022-04-15 17:41:33,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:33,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:33,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:33,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 256 states have (on average 1.359375) internal successors, (348), 255 states have internal predecessors, (348), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-04-15 17:41:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 418 transitions. [2022-04-15 17:41:33,690 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 418 transitions. Word has length 45 [2022-04-15 17:41:33,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:33,691 INFO L478 AbstractCegarLoop]: Abstraction has 315 states and 418 transitions. [2022-04-15 17:41:33,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 17:41:33,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 315 states and 418 transitions. [2022-04-15 17:41:34,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 418 edges. 418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:34,109 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 418 transitions. [2022-04-15 17:41:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 17:41:34,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:34,110 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:34,110 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 17:41:34,110 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:34,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1782707845, now seen corresponding path program 1 times [2022-04-15 17:41:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:34,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1845858771] [2022-04-15 17:41:34,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1782707845, now seen corresponding path program 2 times [2022-04-15 17:41:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:34,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017525563] [2022-04-15 17:41:34,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:34,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:34,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:34,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {12674#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {12649#true} is VALID [2022-04-15 17:41:34,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {12649#true} assume true; {12649#true} is VALID [2022-04-15 17:41:34,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12649#true} {12649#true} #780#return; {12649#true} is VALID [2022-04-15 17:41:34,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:34,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {12675#(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; {12676#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} is VALID [2022-04-15 17:41:34,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {12676#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} assume true; {12676#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} is VALID [2022-04-15 17:41:34,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12676#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} {12649#true} #714#return; {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:34,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {12677#(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; {12649#true} is VALID [2022-04-15 17:41:34,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {12649#true} assume true; {12649#true} is VALID [2022-04-15 17:41:34,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12649#true} {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} #716#return; {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 17:41:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:34,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-15 17:41:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:34,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {12684#(= ~s~0 |old(~s~0)|)} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {12649#true} is VALID [2022-04-15 17:41:34,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {12649#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {12685#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 17:41:34,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {12685#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} assume true; {12685#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 17:41:34,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12685#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} {12649#true} #740#return; {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:34,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {12678#(and (= ~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 ~Irp__IoStatus__Information~1;assume -2147483648 <= #t~nondet65 && #t~nondet65 <= 2147483647;~irpStack__Parameters__DeviceIoControl__IoControlCode~0 := #t~nondet65;havoc #t~nondet65;assume -2147483648 <= #t~nondet66 && #t~nondet66 <= 2147483647;~devExt__UpperConnectData__ClassService~1 := #t~nondet66;havoc #t~nondet66;assume -2147483648 <= #t~nondet67 && #t~nondet67 <= 2147483647;~irpStack__Parameters__DeviceIoControl__InputBufferLength~0 := #t~nondet67;havoc #t~nondet67;assume -2147483648 <= #t~nondet68 && #t~nondet68 <= 2147483647;~sizeof__CONNECT_DATA~0 := #t~nondet68;havoc #t~nondet68;assume -2147483648 <= #t~nondet69 && #t~nondet69 <= 2147483647;~irpStack__Parameters__DeviceIoControl__Type3InputBuffer~0 := #t~nondet69;havoc #t~nondet69;assume -2147483648 <= #t~nondet70 && #t~nondet70 <= 2147483647;~sizeof__INTERNAL_I8042_HOOK_KEYBOARD~0 := #t~nondet70;havoc #t~nondet70;assume -2147483648 <= #t~nondet71 && #t~nondet71 <= 2147483647;~hookKeyboard__InitializationRoutine~0 := #t~nondet71;havoc #t~nondet71;assume -2147483648 <= #t~nondet72 && #t~nondet72 <= 2147483647;~hookKeyboard__IsrRoutine~0 := #t~nondet72;havoc #t~nondet72;havoc ~Irp__IoStatus__Status~2;havoc ~hookKeyboard~0;havoc ~connectData~0;havoc ~status~3;havoc ~tmp~3;havoc ~__cil_tmp17~0;havoc ~__cil_tmp18~0;havoc ~__cil_tmp19~0;assume -2147483648 <= #t~nondet73 && #t~nondet73 <= 2147483647;~__cil_tmp20~0 := #t~nondet73;havoc #t~nondet73;havoc ~__cil_tmp21~0;havoc ~__cil_tmp22~0;havoc ~__cil_tmp23~1;assume -2147483648 <= #t~nondet74 && #t~nondet74 <= 2147483647;~__cil_tmp24~0 := #t~nondet74;havoc #t~nondet74;havoc ~__cil_tmp25~0;havoc ~__cil_tmp26~0;havoc ~__cil_tmp27~0;assume -2147483648 <= #t~nondet75 && #t~nondet75 <= 2147483647;~__cil_tmp28~0 := #t~nondet75;havoc #t~nondet75;assume -2147483648 <= #t~nondet76 && #t~nondet76 <= 2147483647;~__cil_tmp29~0 := #t~nondet76;havoc #t~nondet76;havoc ~__cil_tmp30~0;havoc ~__cil_tmp31~0;assume -2147483648 <= #t~nondet77 && #t~nondet77 <= 2147483647;~__cil_tmp32~0 := #t~nondet77;havoc #t~nondet77;havoc ~__cil_tmp33~0;havoc ~__cil_tmp34~0;assume -2147483648 <= #t~nondet78 && #t~nondet78 <= 2147483647;~__cil_tmp35~0 := #t~nondet78;havoc #t~nondet78;havoc ~__cil_tmp36~0;havoc ~__cil_tmp37~0;assume -2147483648 <= #t~nondet79 && #t~nondet79 <= 2147483647;~__cil_tmp38~0 := #t~nondet79;havoc #t~nondet79;havoc ~__cil_tmp39~0;havoc ~__cil_tmp40~0;assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~__cil_tmp41~0 := #t~nondet80;havoc #t~nondet80;havoc ~__cil_tmp42~0;havoc ~__cil_tmp43~0;assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~__cil_tmp44~0 := #t~nondet81;havoc #t~nondet81;havoc ~__cil_tmp45~0;~status~3 := 0;~Irp__IoStatus__Information~1 := 0; {12649#true} is VALID [2022-04-15 17:41:34,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {12649#true} assume ~irpStack__Parameters__DeviceIoControl__IoControlCode~0 == ~__cil_tmp20~0; {12649#true} is VALID [2022-04-15 17:41:34,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {12649#true} assume 0 != ~devExt__UpperConnectData__ClassService~1;~status~3 := -1073741757; {12649#true} is VALID [2022-04-15 17:41:34,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {12649#true} assume ~status~3 < 0;~Irp__IoStatus__Status~2 := ~status~3;~myStatus~0 := ~status~3; {12649#true} is VALID [2022-04-15 17:41:34,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {12649#true} call IofCompleteRequest(~Irp, 0); {12684#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:34,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {12684#(= ~s~0 |old(~s~0)|)} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {12649#true} is VALID [2022-04-15 17:41:34,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {12649#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {12685#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 17:41:34,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {12685#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} assume true; {12685#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 17:41:34,342 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12685#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} {12649#true} #740#return; {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:34,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} #res := ~status~3; {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:34,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} assume true; {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:34,344 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} #726#return; {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {12649#true} call ULTIMATE.init(); {12674#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:34,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {12674#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {12649#true} is VALID [2022-04-15 17:41:34,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {12649#true} assume true; {12649#true} is VALID [2022-04-15 17:41:34,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12649#true} {12649#true} #780#return; {12649#true} is VALID [2022-04-15 17:41:34,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {12649#true} call #t~ret83 := main(); {12649#true} is VALID [2022-04-15 17:41:34,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {12649#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;~DevicePowerState~0 := 1;~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; {12649#true} is VALID [2022-04-15 17:41:34,347 INFO L272 TraceCheckUtils]: 6: Hoare triple {12649#true} call _BLAST_init(); {12675#(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-15 17:41:34,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {12675#(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; {12676#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} is VALID [2022-04-15 17:41:34,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {12676#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} assume true; {12676#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} is VALID [2022-04-15 17:41:34,348 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {12676#(and (<= 7 ~IPC~0) (= (+ (- 2) ~DC~0) 0))} {12649#true} #714#return; {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} 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; {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume !(0 == ~irp_choice~0); {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,350 INFO L272 TraceCheckUtils]: 12: Hoare triple {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} call stub_driver_init(); {12677#(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-15 17:41:34,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {12677#(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; {12649#true} is VALID [2022-04-15 17:41:34,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {12649#true} assume true; {12649#true} is VALID [2022-04-15 17:41:34,350 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12649#true} {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} #716#return; {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume !(3 == ~tmp_ndt_3~0);havoc ~tmp_ndt_4~0;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp_ndt_4~0 := #t~nondet29;havoc #t~nondet29; {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume !(4 == ~tmp_ndt_4~0);havoc ~tmp_ndt_5~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_5~0 := #t~nondet30;havoc #t~nondet30; {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} assume 8 == ~tmp_ndt_5~0; {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,353 INFO L272 TraceCheckUtils]: 22: Hoare triple {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} call #t~ret35 := KbFilter_InternIoCtl(~devobj~0, ~pirp~0); {12678#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:34,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {12678#(and (= ~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 ~Irp__IoStatus__Information~1;assume -2147483648 <= #t~nondet65 && #t~nondet65 <= 2147483647;~irpStack__Parameters__DeviceIoControl__IoControlCode~0 := #t~nondet65;havoc #t~nondet65;assume -2147483648 <= #t~nondet66 && #t~nondet66 <= 2147483647;~devExt__UpperConnectData__ClassService~1 := #t~nondet66;havoc #t~nondet66;assume -2147483648 <= #t~nondet67 && #t~nondet67 <= 2147483647;~irpStack__Parameters__DeviceIoControl__InputBufferLength~0 := #t~nondet67;havoc #t~nondet67;assume -2147483648 <= #t~nondet68 && #t~nondet68 <= 2147483647;~sizeof__CONNECT_DATA~0 := #t~nondet68;havoc #t~nondet68;assume -2147483648 <= #t~nondet69 && #t~nondet69 <= 2147483647;~irpStack__Parameters__DeviceIoControl__Type3InputBuffer~0 := #t~nondet69;havoc #t~nondet69;assume -2147483648 <= #t~nondet70 && #t~nondet70 <= 2147483647;~sizeof__INTERNAL_I8042_HOOK_KEYBOARD~0 := #t~nondet70;havoc #t~nondet70;assume -2147483648 <= #t~nondet71 && #t~nondet71 <= 2147483647;~hookKeyboard__InitializationRoutine~0 := #t~nondet71;havoc #t~nondet71;assume -2147483648 <= #t~nondet72 && #t~nondet72 <= 2147483647;~hookKeyboard__IsrRoutine~0 := #t~nondet72;havoc #t~nondet72;havoc ~Irp__IoStatus__Status~2;havoc ~hookKeyboard~0;havoc ~connectData~0;havoc ~status~3;havoc ~tmp~3;havoc ~__cil_tmp17~0;havoc ~__cil_tmp18~0;havoc ~__cil_tmp19~0;assume -2147483648 <= #t~nondet73 && #t~nondet73 <= 2147483647;~__cil_tmp20~0 := #t~nondet73;havoc #t~nondet73;havoc ~__cil_tmp21~0;havoc ~__cil_tmp22~0;havoc ~__cil_tmp23~1;assume -2147483648 <= #t~nondet74 && #t~nondet74 <= 2147483647;~__cil_tmp24~0 := #t~nondet74;havoc #t~nondet74;havoc ~__cil_tmp25~0;havoc ~__cil_tmp26~0;havoc ~__cil_tmp27~0;assume -2147483648 <= #t~nondet75 && #t~nondet75 <= 2147483647;~__cil_tmp28~0 := #t~nondet75;havoc #t~nondet75;assume -2147483648 <= #t~nondet76 && #t~nondet76 <= 2147483647;~__cil_tmp29~0 := #t~nondet76;havoc #t~nondet76;havoc ~__cil_tmp30~0;havoc ~__cil_tmp31~0;assume -2147483648 <= #t~nondet77 && #t~nondet77 <= 2147483647;~__cil_tmp32~0 := #t~nondet77;havoc #t~nondet77;havoc ~__cil_tmp33~0;havoc ~__cil_tmp34~0;assume -2147483648 <= #t~nondet78 && #t~nondet78 <= 2147483647;~__cil_tmp35~0 := #t~nondet78;havoc #t~nondet78;havoc ~__cil_tmp36~0;havoc ~__cil_tmp37~0;assume -2147483648 <= #t~nondet79 && #t~nondet79 <= 2147483647;~__cil_tmp38~0 := #t~nondet79;havoc #t~nondet79;havoc ~__cil_tmp39~0;havoc ~__cil_tmp40~0;assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~__cil_tmp41~0 := #t~nondet80;havoc #t~nondet80;havoc ~__cil_tmp42~0;havoc ~__cil_tmp43~0;assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~__cil_tmp44~0 := #t~nondet81;havoc #t~nondet81;havoc ~__cil_tmp45~0;~status~3 := 0;~Irp__IoStatus__Information~1 := 0; {12649#true} is VALID [2022-04-15 17:41:34,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {12649#true} assume ~irpStack__Parameters__DeviceIoControl__IoControlCode~0 == ~__cil_tmp20~0; {12649#true} is VALID [2022-04-15 17:41:34,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {12649#true} assume 0 != ~devExt__UpperConnectData__ClassService~1;~status~3 := -1073741757; {12649#true} is VALID [2022-04-15 17:41:34,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {12649#true} assume ~status~3 < 0;~Irp__IoStatus__Status~2 := ~status~3;~myStatus~0 := ~status~3; {12649#true} is VALID [2022-04-15 17:41:34,356 INFO L272 TraceCheckUtils]: 27: Hoare triple {12649#true} call IofCompleteRequest(~Irp, 0); {12684#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:34,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {12684#(= ~s~0 |old(~s~0)|)} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {12649#true} is VALID [2022-04-15 17:41:34,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {12649#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {12685#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 17:41:34,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {12685#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} assume true; {12685#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} is VALID [2022-04-15 17:41:34,357 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12685#(and (<= ~s~0 ~DC~0) (<= ~DC~0 ~s~0))} {12649#true} #740#return; {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:34,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} #res := ~status~3; {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:34,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} assume true; {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} is VALID [2022-04-15 17:41:34,359 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {12683#(and (or (not (<= ~s~0 1)) (<= ~DC~0 ~s~0)) (or (<= ~s~0 ~DC~0) (<= ~s~0 2)))} {12657#(and (= 2 ~DC~0) (not (= ~IPC~0 2)))} #726#return; {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;~status~1 := #t~ret35;havoc #t~ret35; {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume !(1 == ~pended~0); {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume !(1 == ~pended~0); {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume ~s~0 != ~UNLOADED~0; {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume -1 != ~status~1; {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,362 INFO L290 TraceCheckUtils]: 40: Hoare triple {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume ~s~0 != ~SKIP2~0; {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} is VALID [2022-04-15 17:41:34,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {12673#(and (= 2 ~s~0) (not (= ~IPC~0 2)))} assume !(~s~0 != ~IPC~0); {12650#false} is VALID [2022-04-15 17:41:34,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {12650#false} assume 1 == ~pended~0; {12650#false} is VALID [2022-04-15 17:41:34,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {12650#false} assume 259 != ~status~1; {12650#false} is VALID [2022-04-15 17:41:34,362 INFO L272 TraceCheckUtils]: 44: Hoare triple {12650#false} call errorFn(); {12650#false} is VALID [2022-04-15 17:41:34,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {12650#false} assume !false; {12650#false} is VALID [2022-04-15 17:41:34,363 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-15 17:41:34,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:34,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017525563] [2022-04-15 17:41:34,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017525563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:34,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:34,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:41:34,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:34,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1845858771] [2022-04-15 17:41:34,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1845858771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:34,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:34,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:41:34,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422216217] [2022-04-15 17:41:34,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:34,364 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-15 17:41:34,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:34,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 17:41:34,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:34,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 17:41:34,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:34,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 17:41:34,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:41:34,415 INFO L87 Difference]: Start difference. First operand 315 states and 418 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 17:41:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:36,999 INFO L93 Difference]: Finished difference Result 327 states and 429 transitions. [2022-04-15 17:41:36,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 17:41:36,999 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-15 17:41:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:37,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 17:41:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 354 transitions. [2022-04-15 17:41:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 17:41:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 354 transitions. [2022-04-15 17:41:37,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 354 transitions. [2022-04-15 17:41:37,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 354 edges. 354 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:37,346 INFO L225 Difference]: With dead ends: 327 [2022-04-15 17:41:37,346 INFO L226 Difference]: Without dead ends: 322 [2022-04-15 17:41:37,347 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-04-15 17:41:37,347 INFO L913 BasicCegarLoop]: 253 mSDtfsCounter, 795 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:37,348 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [797 Valid, 508 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 17:41:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-04-15 17:41:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 316. [2022-04-15 17:41:37,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:37,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 322 states. Second operand has 316 states, 257 states have (on average 1.3579766536964981) internal successors, (349), 256 states have internal predecessors, (349), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-04-15 17:41:37,666 INFO L74 IsIncluded]: Start isIncluded. First operand 322 states. Second operand has 316 states, 257 states have (on average 1.3579766536964981) internal successors, (349), 256 states have internal predecessors, (349), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-04-15 17:41:37,667 INFO L87 Difference]: Start difference. First operand 322 states. Second operand has 316 states, 257 states have (on average 1.3579766536964981) internal successors, (349), 256 states have internal predecessors, (349), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-04-15 17:41:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:37,672 INFO L93 Difference]: Finished difference Result 322 states and 424 transitions. [2022-04-15 17:41:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 424 transitions. [2022-04-15 17:41:37,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:37,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:37,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 316 states, 257 states have (on average 1.3579766536964981) internal successors, (349), 256 states have internal predecessors, (349), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) Second operand 322 states. [2022-04-15 17:41:37,674 INFO L87 Difference]: Start difference. First operand has 316 states, 257 states have (on average 1.3579766536964981) internal successors, (349), 256 states have internal predecessors, (349), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) Second operand 322 states. [2022-04-15 17:41:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:37,679 INFO L93 Difference]: Finished difference Result 322 states and 424 transitions. [2022-04-15 17:41:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 424 transitions. [2022-04-15 17:41:37,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:37,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:37,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:37,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 257 states have (on average 1.3579766536964981) internal successors, (349), 256 states have internal predecessors, (349), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2022-04-15 17:41:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 419 transitions. [2022-04-15 17:41:37,687 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 419 transitions. Word has length 46 [2022-04-15 17:41:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:37,687 INFO L478 AbstractCegarLoop]: Abstraction has 316 states and 419 transitions. [2022-04-15 17:41:37,687 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 17:41:37,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 316 states and 419 transitions. [2022-04-15 17:41:38,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 419 edges. 419 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 419 transitions. [2022-04-15 17:41:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 17:41:38,116 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:38,116 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:38,116 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 17:41:38,116 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:38,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:38,116 INFO L85 PathProgramCache]: Analyzing trace with hash 359403676, now seen corresponding path program 1 times [2022-04-15 17:41:38,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:38,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1153284619] [2022-04-15 17:41:38,117 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:38,117 INFO L85 PathProgramCache]: Analyzing trace with hash 359403676, now seen corresponding path program 2 times [2022-04-15 17:41:38,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:38,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613078625] [2022-04-15 17:41:38,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:38,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:38,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:38,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {14659#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {14635#true} is VALID [2022-04-15 17:41:38,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {14635#true} assume true; {14635#true} is VALID [2022-04-15 17:41:38,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14635#true} {14635#true} #780#return; {14635#true} is VALID [2022-04-15 17:41:38,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:38,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {14660#(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; {14635#true} is VALID [2022-04-15 17:41:38,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {14635#true} assume true; {14635#true} is VALID [2022-04-15 17:41:38,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14635#true} {14635#true} #714#return; {14635#true} is VALID [2022-04-15 17:41:38,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:38,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {14661#(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; {14635#true} is VALID [2022-04-15 17:41:38,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {14635#true} assume true; {14635#true} is VALID [2022-04-15 17:41:38,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14635#true} {14635#true} #716#return; {14635#true} is VALID [2022-04-15 17:41:38,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 17:41:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-15 17:41:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:38,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {14667#(= ~s~0 |old(~s~0)|)} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {14635#true} is VALID [2022-04-15 17:41:38,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {14635#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {14635#true} is VALID [2022-04-15 17:41:38,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {14635#true} assume true; {14635#true} is VALID [2022-04-15 17:41:38,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14635#true} {14635#true} #740#return; {14635#true} is VALID [2022-04-15 17:41:38,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {14662#(and (= ~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 ~Irp__IoStatus__Information~1;assume -2147483648 <= #t~nondet65 && #t~nondet65 <= 2147483647;~irpStack__Parameters__DeviceIoControl__IoControlCode~0 := #t~nondet65;havoc #t~nondet65;assume -2147483648 <= #t~nondet66 && #t~nondet66 <= 2147483647;~devExt__UpperConnectData__ClassService~1 := #t~nondet66;havoc #t~nondet66;assume -2147483648 <= #t~nondet67 && #t~nondet67 <= 2147483647;~irpStack__Parameters__DeviceIoControl__InputBufferLength~0 := #t~nondet67;havoc #t~nondet67;assume -2147483648 <= #t~nondet68 && #t~nondet68 <= 2147483647;~sizeof__CONNECT_DATA~0 := #t~nondet68;havoc #t~nondet68;assume -2147483648 <= #t~nondet69 && #t~nondet69 <= 2147483647;~irpStack__Parameters__DeviceIoControl__Type3InputBuffer~0 := #t~nondet69;havoc #t~nondet69;assume -2147483648 <= #t~nondet70 && #t~nondet70 <= 2147483647;~sizeof__INTERNAL_I8042_HOOK_KEYBOARD~0 := #t~nondet70;havoc #t~nondet70;assume -2147483648 <= #t~nondet71 && #t~nondet71 <= 2147483647;~hookKeyboard__InitializationRoutine~0 := #t~nondet71;havoc #t~nondet71;assume -2147483648 <= #t~nondet72 && #t~nondet72 <= 2147483647;~hookKeyboard__IsrRoutine~0 := #t~nondet72;havoc #t~nondet72;havoc ~Irp__IoStatus__Status~2;havoc ~hookKeyboard~0;havoc ~connectData~0;havoc ~status~3;havoc ~tmp~3;havoc ~__cil_tmp17~0;havoc ~__cil_tmp18~0;havoc ~__cil_tmp19~0;assume -2147483648 <= #t~nondet73 && #t~nondet73 <= 2147483647;~__cil_tmp20~0 := #t~nondet73;havoc #t~nondet73;havoc ~__cil_tmp21~0;havoc ~__cil_tmp22~0;havoc ~__cil_tmp23~1;assume -2147483648 <= #t~nondet74 && #t~nondet74 <= 2147483647;~__cil_tmp24~0 := #t~nondet74;havoc #t~nondet74;havoc ~__cil_tmp25~0;havoc ~__cil_tmp26~0;havoc ~__cil_tmp27~0;assume -2147483648 <= #t~nondet75 && #t~nondet75 <= 2147483647;~__cil_tmp28~0 := #t~nondet75;havoc #t~nondet75;assume -2147483648 <= #t~nondet76 && #t~nondet76 <= 2147483647;~__cil_tmp29~0 := #t~nondet76;havoc #t~nondet76;havoc ~__cil_tmp30~0;havoc ~__cil_tmp31~0;assume -2147483648 <= #t~nondet77 && #t~nondet77 <= 2147483647;~__cil_tmp32~0 := #t~nondet77;havoc #t~nondet77;havoc ~__cil_tmp33~0;havoc ~__cil_tmp34~0;assume -2147483648 <= #t~nondet78 && #t~nondet78 <= 2147483647;~__cil_tmp35~0 := #t~nondet78;havoc #t~nondet78;havoc ~__cil_tmp36~0;havoc ~__cil_tmp37~0;assume -2147483648 <= #t~nondet79 && #t~nondet79 <= 2147483647;~__cil_tmp38~0 := #t~nondet79;havoc #t~nondet79;havoc ~__cil_tmp39~0;havoc ~__cil_tmp40~0;assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~__cil_tmp41~0 := #t~nondet80;havoc #t~nondet80;havoc ~__cil_tmp42~0;havoc ~__cil_tmp43~0;assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~__cil_tmp44~0 := #t~nondet81;havoc #t~nondet81;havoc ~__cil_tmp45~0;~status~3 := 0;~Irp__IoStatus__Information~1 := 0; {14635#true} is VALID [2022-04-15 17:41:38,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {14635#true} assume ~irpStack__Parameters__DeviceIoControl__IoControlCode~0 == ~__cil_tmp20~0; {14635#true} is VALID [2022-04-15 17:41:38,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {14635#true} assume 0 != ~devExt__UpperConnectData__ClassService~1;~status~3 := -1073741757; {14635#true} is VALID [2022-04-15 17:41:38,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {14635#true} assume ~status~3 < 0;~Irp__IoStatus__Status~2 := ~status~3;~myStatus~0 := ~status~3; {14635#true} is VALID [2022-04-15 17:41:38,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {14635#true} call IofCompleteRequest(~Irp, 0); {14667#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:38,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {14667#(= ~s~0 |old(~s~0)|)} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {14635#true} is VALID [2022-04-15 17:41:38,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {14635#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {14635#true} is VALID [2022-04-15 17:41:38,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {14635#true} assume true; {14635#true} is VALID [2022-04-15 17:41:38,260 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14635#true} {14635#true} #740#return; {14635#true} is VALID [2022-04-15 17:41:38,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {14635#true} #res := ~status~3; {14635#true} is VALID [2022-04-15 17:41:38,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {14635#true} assume true; {14635#true} is VALID [2022-04-15 17:41:38,261 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {14635#true} {14635#true} #726#return; {14635#true} is VALID [2022-04-15 17:41:38,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {14635#true} call ULTIMATE.init(); {14659#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:38,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {14659#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {14635#true} is VALID [2022-04-15 17:41:38,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {14635#true} assume true; {14635#true} is VALID [2022-04-15 17:41:38,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14635#true} {14635#true} #780#return; {14635#true} is VALID [2022-04-15 17:41:38,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {14635#true} call #t~ret83 := main(); {14635#true} is VALID [2022-04-15 17:41:38,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {14635#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;~DevicePowerState~0 := 1;~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; {14635#true} is VALID [2022-04-15 17:41:38,264 INFO L272 TraceCheckUtils]: 6: Hoare triple {14635#true} call _BLAST_init(); {14660#(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-15 17:41:38,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {14660#(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; {14635#true} is VALID [2022-04-15 17:41:38,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {14635#true} assume true; {14635#true} is VALID [2022-04-15 17:41:38,264 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {14635#true} {14635#true} #714#return; {14635#true} is VALID [2022-04-15 17:41:38,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {14635#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; {14635#true} is VALID [2022-04-15 17:41:38,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {14635#true} assume !(0 == ~irp_choice~0); {14635#true} is VALID [2022-04-15 17:41:38,264 INFO L272 TraceCheckUtils]: 12: Hoare triple {14635#true} call stub_driver_init(); {14661#(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-15 17:41:38,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {14661#(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; {14635#true} is VALID [2022-04-15 17:41:38,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {14635#true} assume true; {14635#true} is VALID [2022-04-15 17:41:38,265 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14635#true} {14635#true} #716#return; {14635#true} is VALID [2022-04-15 17:41:38,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {14635#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {14635#true} is VALID [2022-04-15 17:41:38,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {14635#true} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {14635#true} is VALID [2022-04-15 17:41:38,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {14635#true} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {14635#true} is VALID [2022-04-15 17:41:38,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {14635#true} assume !(3 == ~tmp_ndt_3~0);havoc ~tmp_ndt_4~0;assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647;~tmp_ndt_4~0 := #t~nondet29;havoc #t~nondet29; {14635#true} is VALID [2022-04-15 17:41:38,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {14635#true} assume !(4 == ~tmp_ndt_4~0);havoc ~tmp_ndt_5~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp_ndt_5~0 := #t~nondet30;havoc #t~nondet30; {14635#true} is VALID [2022-04-15 17:41:38,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {14635#true} assume 8 == ~tmp_ndt_5~0; {14635#true} is VALID [2022-04-15 17:41:38,266 INFO L272 TraceCheckUtils]: 22: Hoare triple {14635#true} call #t~ret35 := KbFilter_InternIoCtl(~devobj~0, ~pirp~0); {14662#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:38,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {14662#(and (= ~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 ~Irp__IoStatus__Information~1;assume -2147483648 <= #t~nondet65 && #t~nondet65 <= 2147483647;~irpStack__Parameters__DeviceIoControl__IoControlCode~0 := #t~nondet65;havoc #t~nondet65;assume -2147483648 <= #t~nondet66 && #t~nondet66 <= 2147483647;~devExt__UpperConnectData__ClassService~1 := #t~nondet66;havoc #t~nondet66;assume -2147483648 <= #t~nondet67 && #t~nondet67 <= 2147483647;~irpStack__Parameters__DeviceIoControl__InputBufferLength~0 := #t~nondet67;havoc #t~nondet67;assume -2147483648 <= #t~nondet68 && #t~nondet68 <= 2147483647;~sizeof__CONNECT_DATA~0 := #t~nondet68;havoc #t~nondet68;assume -2147483648 <= #t~nondet69 && #t~nondet69 <= 2147483647;~irpStack__Parameters__DeviceIoControl__Type3InputBuffer~0 := #t~nondet69;havoc #t~nondet69;assume -2147483648 <= #t~nondet70 && #t~nondet70 <= 2147483647;~sizeof__INTERNAL_I8042_HOOK_KEYBOARD~0 := #t~nondet70;havoc #t~nondet70;assume -2147483648 <= #t~nondet71 && #t~nondet71 <= 2147483647;~hookKeyboard__InitializationRoutine~0 := #t~nondet71;havoc #t~nondet71;assume -2147483648 <= #t~nondet72 && #t~nondet72 <= 2147483647;~hookKeyboard__IsrRoutine~0 := #t~nondet72;havoc #t~nondet72;havoc ~Irp__IoStatus__Status~2;havoc ~hookKeyboard~0;havoc ~connectData~0;havoc ~status~3;havoc ~tmp~3;havoc ~__cil_tmp17~0;havoc ~__cil_tmp18~0;havoc ~__cil_tmp19~0;assume -2147483648 <= #t~nondet73 && #t~nondet73 <= 2147483647;~__cil_tmp20~0 := #t~nondet73;havoc #t~nondet73;havoc ~__cil_tmp21~0;havoc ~__cil_tmp22~0;havoc ~__cil_tmp23~1;assume -2147483648 <= #t~nondet74 && #t~nondet74 <= 2147483647;~__cil_tmp24~0 := #t~nondet74;havoc #t~nondet74;havoc ~__cil_tmp25~0;havoc ~__cil_tmp26~0;havoc ~__cil_tmp27~0;assume -2147483648 <= #t~nondet75 && #t~nondet75 <= 2147483647;~__cil_tmp28~0 := #t~nondet75;havoc #t~nondet75;assume -2147483648 <= #t~nondet76 && #t~nondet76 <= 2147483647;~__cil_tmp29~0 := #t~nondet76;havoc #t~nondet76;havoc ~__cil_tmp30~0;havoc ~__cil_tmp31~0;assume -2147483648 <= #t~nondet77 && #t~nondet77 <= 2147483647;~__cil_tmp32~0 := #t~nondet77;havoc #t~nondet77;havoc ~__cil_tmp33~0;havoc ~__cil_tmp34~0;assume -2147483648 <= #t~nondet78 && #t~nondet78 <= 2147483647;~__cil_tmp35~0 := #t~nondet78;havoc #t~nondet78;havoc ~__cil_tmp36~0;havoc ~__cil_tmp37~0;assume -2147483648 <= #t~nondet79 && #t~nondet79 <= 2147483647;~__cil_tmp38~0 := #t~nondet79;havoc #t~nondet79;havoc ~__cil_tmp39~0;havoc ~__cil_tmp40~0;assume -2147483648 <= #t~nondet80 && #t~nondet80 <= 2147483647;~__cil_tmp41~0 := #t~nondet80;havoc #t~nondet80;havoc ~__cil_tmp42~0;havoc ~__cil_tmp43~0;assume -2147483648 <= #t~nondet81 && #t~nondet81 <= 2147483647;~__cil_tmp44~0 := #t~nondet81;havoc #t~nondet81;havoc ~__cil_tmp45~0;~status~3 := 0;~Irp__IoStatus__Information~1 := 0; {14635#true} is VALID [2022-04-15 17:41:38,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {14635#true} assume ~irpStack__Parameters__DeviceIoControl__IoControlCode~0 == ~__cil_tmp20~0; {14635#true} is VALID [2022-04-15 17:41:38,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {14635#true} assume 0 != ~devExt__UpperConnectData__ClassService~1;~status~3 := -1073741757; {14635#true} is VALID [2022-04-15 17:41:38,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {14635#true} assume ~status~3 < 0;~Irp__IoStatus__Status~2 := ~status~3;~myStatus~0 := ~status~3; {14635#true} is VALID [2022-04-15 17:41:38,266 INFO L272 TraceCheckUtils]: 27: Hoare triple {14635#true} call IofCompleteRequest(~Irp, 0); {14667#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:38,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {14667#(= ~s~0 |old(~s~0)|)} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {14635#true} is VALID [2022-04-15 17:41:38,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {14635#true} assume ~s~0 == ~NP~0;~s~0 := ~DC~0; {14635#true} is VALID [2022-04-15 17:41:38,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {14635#true} assume true; {14635#true} is VALID [2022-04-15 17:41:38,267 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14635#true} {14635#true} #740#return; {14635#true} is VALID [2022-04-15 17:41:38,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {14635#true} #res := ~status~3; {14635#true} is VALID [2022-04-15 17:41:38,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {14635#true} assume true; {14635#true} is VALID [2022-04-15 17:41:38,267 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {14635#true} {14635#true} #726#return; {14635#true} is VALID [2022-04-15 17:41:38,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {14635#true} assume -2147483648 <= #t~ret35 && #t~ret35 <= 2147483647;~status~1 := #t~ret35;havoc #t~ret35; {14635#true} is VALID [2022-04-15 17:41:38,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {14635#true} assume !(1 == ~pended~0); {14658#(not (= ~pended~0 1))} is VALID [2022-04-15 17:41:38,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {14658#(not (= ~pended~0 1))} assume !(1 == ~pended~0); {14658#(not (= ~pended~0 1))} is VALID [2022-04-15 17:41:38,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {14658#(not (= ~pended~0 1))} assume ~s~0 != ~UNLOADED~0; {14658#(not (= ~pended~0 1))} is VALID [2022-04-15 17:41:38,268 INFO L290 TraceCheckUtils]: 39: Hoare triple {14658#(not (= ~pended~0 1))} assume -1 != ~status~1; {14658#(not (= ~pended~0 1))} is VALID [2022-04-15 17:41:38,268 INFO L290 TraceCheckUtils]: 40: Hoare triple {14658#(not (= ~pended~0 1))} assume ~s~0 != ~SKIP2~0; {14658#(not (= ~pended~0 1))} is VALID [2022-04-15 17:41:38,268 INFO L290 TraceCheckUtils]: 41: Hoare triple {14658#(not (= ~pended~0 1))} assume ~s~0 != ~IPC~0; {14658#(not (= ~pended~0 1))} is VALID [2022-04-15 17:41:38,269 INFO L290 TraceCheckUtils]: 42: Hoare triple {14658#(not (= ~pended~0 1))} assume ~s~0 == ~DC~0; {14658#(not (= ~pended~0 1))} is VALID [2022-04-15 17:41:38,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {14658#(not (= ~pended~0 1))} assume 1 == ~pended~0; {14636#false} is VALID [2022-04-15 17:41:38,269 INFO L290 TraceCheckUtils]: 44: Hoare triple {14636#false} assume 259 != ~status~1; {14636#false} is VALID [2022-04-15 17:41:38,269 INFO L272 TraceCheckUtils]: 45: Hoare triple {14636#false} call errorFn(); {14636#false} is VALID [2022-04-15 17:41:38,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {14636#false} assume !false; {14636#false} is VALID [2022-04-15 17:41:38,269 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-15 17:41:38,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:38,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613078625] [2022-04-15 17:41:38,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613078625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:38,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:38,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 17:41:38,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:38,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1153284619] [2022-04-15 17:41:38,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1153284619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:38,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:38,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 17:41:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159611768] [2022-04-15 17:41:38,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:38,271 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-04-15 17:41:38,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:38,272 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 17:41:38,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:38,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 17:41:38,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:38,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 17:41:38,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-15 17:41:38,298 INFO L87 Difference]: Start difference. First operand 316 states and 419 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 17:41:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:39,874 INFO L93 Difference]: Finished difference Result 330 states and 436 transitions. [2022-04-15 17:41:39,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 17:41:39,875 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-04-15 17:41:39,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:39,875 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 17:41:39,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2022-04-15 17:41:39,877 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 17:41:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2022-04-15 17:41:39,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 338 transitions. [2022-04-15 17:41:40,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 338 edges. 338 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:40,193 INFO L225 Difference]: With dead ends: 330 [2022-04-15 17:41:40,193 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 17:41:40,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:41:40,194 INFO L913 BasicCegarLoop]: 247 mSDtfsCounter, 576 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:40,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 423 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 17:41:40,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 17:41:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-15 17:41:40,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:40,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 15 states have call successors, (15), 13 states have call predecessors, (15), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 17:41:40,304 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 15 states have call successors, (15), 13 states have call predecessors, (15), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 17:41:40,304 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 15 states have call successors, (15), 13 states have call predecessors, (15), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 17:41:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:40,306 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-04-15 17:41:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-04-15 17:41:40,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:40,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:40,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 15 states have call successors, (15), 13 states have call predecessors, (15), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 102 states. [2022-04-15 17:41:40,307 INFO L87 Difference]: Start difference. First operand has 102 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 15 states have call successors, (15), 13 states have call predecessors, (15), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Second operand 102 states. [2022-04-15 17:41:40,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:40,308 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-04-15 17:41:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-04-15 17:41:40,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:40,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:40,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:40,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 15 states have call successors, (15), 13 states have call predecessors, (15), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-15 17:41:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2022-04-15 17:41:40,310 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 47 [2022-04-15 17:41:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:40,310 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2022-04-15 17:41:40,310 INFO L479 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, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 17:41:40,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 118 transitions. [2022-04-15 17:41:40,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-04-15 17:41:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 17:41:40,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:40,425 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:40,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 17:41:40,426 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:40,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash -803867800, now seen corresponding path program 1 times [2022-04-15 17:41:40,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:40,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [445071705] [2022-04-15 17:41:40,426 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash -803867800, now seen corresponding path program 2 times [2022-04-15 17:41:40,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:40,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846790784] [2022-04-15 17:41:40,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:40,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:40,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:40,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {15771#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {15748#true} is VALID [2022-04-15 17:41:40,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {15748#true} assume true; {15748#true} is VALID [2022-04-15 17:41:40,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15748#true} {15748#true} #780#return; {15748#true} is VALID [2022-04-15 17:41:40,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:40,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {15772#(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; {15748#true} is VALID [2022-04-15 17:41:40,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {15748#true} assume true; {15748#true} is VALID [2022-04-15 17:41:40,514 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15748#true} {15748#true} #714#return; {15748#true} is VALID [2022-04-15 17:41:40,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:40,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {15773#(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; {15748#true} is VALID [2022-04-15 17:41:40,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {15748#true} assume true; {15748#true} is VALID [2022-04-15 17:41:40,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15748#true} {15748#true} #716#return; {15748#true} is VALID [2022-04-15 17:41:40,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-15 17:41:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:40,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 17:41:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:40,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {15774#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {15748#true} is VALID [2022-04-15 17:41:40,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {15748#true} assume true; {15748#true} is VALID [2022-04-15 17:41:40,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15748#true} {15748#true} #712#return; {15748#true} is VALID [2022-04-15 17:41:40,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {15774#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {15748#true} is VALID [2022-04-15 17:41:40,537 INFO L272 TraceCheckUtils]: 1: Hoare triple {15748#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {15774#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:40,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {15774#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {15748#true} is VALID [2022-04-15 17:41:40,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {15748#true} assume true; {15748#true} is VALID [2022-04-15 17:41:40,537 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15748#true} {15748#true} #712#return; {15748#true} is VALID [2022-04-15 17:41:40,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {15748#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {15748#true} is VALID [2022-04-15 17:41:40,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {15748#true} assume true; {15748#true} is VALID [2022-04-15 17:41:40,537 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15748#true} {15748#true} #774#return; {15748#true} is VALID [2022-04-15 17:41:40,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-15 17:41:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:40,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {15778#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 17:41:40,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume true; {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 17:41:40,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} {15748#true} #776#return; {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 17:41:40,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {15748#true} call ULTIMATE.init(); {15771#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:40,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {15771#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {15748#true} is VALID [2022-04-15 17:41:40,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {15748#true} assume true; {15748#true} is VALID [2022-04-15 17:41:40,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15748#true} {15748#true} #780#return; {15748#true} is VALID [2022-04-15 17:41:40,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {15748#true} call #t~ret83 := main(); {15748#true} is VALID [2022-04-15 17:41:40,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {15748#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;~DevicePowerState~0 := 1;~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; {15748#true} is VALID [2022-04-15 17:41:40,549 INFO L272 TraceCheckUtils]: 6: Hoare triple {15748#true} call _BLAST_init(); {15772#(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-15 17:41:40,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {15772#(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; {15748#true} is VALID [2022-04-15 17:41:40,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {15748#true} assume true; {15748#true} is VALID [2022-04-15 17:41:40,550 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {15748#true} {15748#true} #714#return; {15748#true} is VALID [2022-04-15 17:41:40,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {15748#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; {15748#true} is VALID [2022-04-15 17:41:40,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {15748#true} assume !(0 == ~irp_choice~0); {15748#true} is VALID [2022-04-15 17:41:40,550 INFO L272 TraceCheckUtils]: 12: Hoare triple {15748#true} call stub_driver_init(); {15773#(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-15 17:41:40,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {15773#(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; {15748#true} is VALID [2022-04-15 17:41:40,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {15748#true} assume true; {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15748#true} {15748#true} #716#return; {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {15748#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {15748#true} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {15748#true} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {15748#true} assume 3 == ~tmp_ndt_3~0; {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L272 TraceCheckUtils]: 20: Hoare triple {15748#true} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {15748#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; {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {15748#true} assume 0 == ~irpStack__MinorFunction~0; {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {15748#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {15748#true} assume !(~s~0 != ~NP~0); {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {15748#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {15748#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L272 TraceCheckUtils]: 27: Hoare triple {15748#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {15748#true} is VALID [2022-04-15 17:41:40,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {15748#true} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;havoc ~returnVal2~0;havoc ~compRetStatus~0;assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {15748#true} is VALID [2022-04-15 17:41:40,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {15748#true} assume 0 != ~compRegistered~0; {15748#true} is VALID [2022-04-15 17:41:40,552 INFO L272 TraceCheckUtils]: 30: Hoare triple {15748#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {15774#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:40,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {15774#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {15748#true} is VALID [2022-04-15 17:41:40,553 INFO L272 TraceCheckUtils]: 32: Hoare triple {15748#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {15774#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:40,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {15774#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {15748#true} is VALID [2022-04-15 17:41:40,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {15748#true} assume true; {15748#true} is VALID [2022-04-15 17:41:40,553 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15748#true} {15748#true} #712#return; {15748#true} is VALID [2022-04-15 17:41:40,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {15748#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {15748#true} is VALID [2022-04-15 17:41:40,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {15748#true} assume true; {15748#true} is VALID [2022-04-15 17:41:40,553 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {15748#true} {15748#true} #774#return; {15748#true} is VALID [2022-04-15 17:41:40,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {15748#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {15748#true} is VALID [2022-04-15 17:41:40,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {15748#true} assume -1073741802 == ~__cil_tmp7~0; {15748#true} is VALID [2022-04-15 17:41:40,553 INFO L272 TraceCheckUtils]: 41: Hoare triple {15748#true} call stubMoreProcessingRequired(); {15778#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:40,554 INFO L290 TraceCheckUtils]: 42: Hoare triple {15778#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 17:41:40,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume true; {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 17:41:40,554 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} {15748#true} #776#return; {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 17:41:40,555 INFO L290 TraceCheckUtils]: 45: Hoare triple {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 17:41:40,555 INFO L290 TraceCheckUtils]: 46: Hoare triple {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume 0 == ~tmp_ndt_6~0; {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 17:41:40,555 INFO L290 TraceCheckUtils]: 47: Hoare triple {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} ~returnVal2~0 := 0; {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 17:41:40,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume !(~s~0 == ~NP~0); {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} is VALID [2022-04-15 17:41:40,556 INFO L290 TraceCheckUtils]: 49: Hoare triple {15770#(= (+ ~MPR1~0 (* (- 1) ~s~0)) 0)} assume !(~s~0 == ~MPR1~0); {15749#false} is VALID [2022-04-15 17:41:40,556 INFO L290 TraceCheckUtils]: 50: Hoare triple {15749#false} assume !(~s~0 == ~SKIP1~0); {15749#false} is VALID [2022-04-15 17:41:40,556 INFO L272 TraceCheckUtils]: 51: Hoare triple {15749#false} call errorFn(); {15749#false} is VALID [2022-04-15 17:41:40,556 INFO L290 TraceCheckUtils]: 52: Hoare triple {15749#false} assume !false; {15749#false} is VALID [2022-04-15 17:41:40,556 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-15 17:41:40,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:40,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846790784] [2022-04-15 17:41:40,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846790784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:40,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:40,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 17:41:40,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:40,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [445071705] [2022-04-15 17:41:40,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [445071705] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:40,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:40,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 17:41:40,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812481827] [2022-04-15 17:41:40,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:40,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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 53 [2022-04-15 17:41:40,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:40,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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-15 17:41:40,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:40,586 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 17:41:40,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:40,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 17:41:40,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-15 17:41:40,587 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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-15 17:41:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:41,040 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2022-04-15 17:41:41,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 17:41:41,040 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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 53 [2022-04-15 17:41:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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-15 17:41:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2022-04-15 17:41:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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-15 17:41:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2022-04-15 17:41:41,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 139 transitions. [2022-04-15 17:41:41,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:41,140 INFO L225 Difference]: With dead ends: 130 [2022-04-15 17:41:41,140 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 17:41:41,141 INFO L912 BasicCegarLoop]: 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-15 17:41:41,141 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 74 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:41,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 197 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:41:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 17:41:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-15 17:41:41,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:41,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 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-15 17:41:41,242 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 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-15 17:41:41,243 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 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-15 17:41:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:41,244 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-04-15 17:41:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-04-15 17:41:41,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:41,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:41,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 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-15 17:41:41,244 INFO L87 Difference]: Start difference. First operand has 100 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 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-15 17:41:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:41,246 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-04-15 17:41:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-04-15 17:41:41,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:41,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:41,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:41,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 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-15 17:41:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-04-15 17:41:41,247 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2022-04-15 17:41:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:41,247 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-04-15 17:41:41,247 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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-15 17:41:41,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 114 transitions. [2022-04-15 17:41:41,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:41,366 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2022-04-15 17:41:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 17:41:41,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:41,367 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:41,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 17:41:41,367 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:41,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1055877385, now seen corresponding path program 1 times [2022-04-15 17:41:41,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:41,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1466872554] [2022-04-15 17:41:41,368 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:41,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1055877385, now seen corresponding path program 2 times [2022-04-15 17:41:41,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:41,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525913439] [2022-04-15 17:41:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:41,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:41,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {16481#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {16448#true} is VALID [2022-04-15 17:41:41,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16448#true} {16448#true} #780#return; {16448#true} is VALID [2022-04-15 17:41:41,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:41,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {16482#(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; {16448#true} is VALID [2022-04-15 17:41:41,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16448#true} {16448#true} #714#return; {16448#true} is VALID [2022-04-15 17:41:41,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:41,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {16483#(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; {16448#true} is VALID [2022-04-15 17:41:41,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16448#true} {16448#true} #716#return; {16448#true} is VALID [2022-04-15 17:41:41,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 17:41:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:41,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 17:41:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 17:41:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:41,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {16495#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {16448#true} is VALID [2022-04-15 17:41:41,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16448#true} {16448#true} #712#return; {16448#true} is VALID [2022-04-15 17:41:41,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {16495#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {16448#true} is VALID [2022-04-15 17:41:41,562 INFO L272 TraceCheckUtils]: 1: Hoare triple {16448#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {16495#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:41,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {16495#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {16448#true} is VALID [2022-04-15 17:41:41,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,562 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16448#true} {16448#true} #712#return; {16448#true} is VALID [2022-04-15 17:41:41,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {16448#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {16448#true} is VALID [2022-04-15 17:41:41,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,562 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16448#true} {16448#true} #774#return; {16448#true} is VALID [2022-04-15 17:41:41,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {16484#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {16448#true} is VALID [2022-04-15 17:41:41,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {16448#true} assume 0 != ~compRegistered~0; {16448#true} is VALID [2022-04-15 17:41:41,563 INFO L272 TraceCheckUtils]: 2: Hoare triple {16448#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {16495#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:41,563 INFO L290 TraceCheckUtils]: 3: Hoare triple {16495#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {16448#true} is VALID [2022-04-15 17:41:41,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {16448#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {16495#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:41,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {16495#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {16448#true} is VALID [2022-04-15 17:41:41,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,564 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16448#true} {16448#true} #712#return; {16448#true} is VALID [2022-04-15 17:41:41,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {16448#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {16448#true} is VALID [2022-04-15 17:41:41,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,564 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16448#true} {16448#true} #774#return; {16448#true} is VALID [2022-04-15 17:41:41,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {16448#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {16448#true} is VALID [2022-04-15 17:41:41,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {16448#true} assume !(-1073741802 == ~__cil_tmp7~0); {16448#true} is VALID [2022-04-15 17:41:41,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {16448#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {16448#true} is VALID [2022-04-15 17:41:41,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {16448#true} assume 0 == ~tmp_ndt_6~0; {16448#true} is VALID [2022-04-15 17:41:41,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {16448#true} ~returnVal2~0 := 0; {16493#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:41,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {16493#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {16493#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:41,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {16493#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {16494#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 17:41:41,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {16494#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} assume true; {16494#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 17:41:41,566 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {16494#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} {16448#true} #752#return; {16479#(= |KbFilter_PnP_#t~ret12| 0)} is VALID [2022-04-15 17:41:41,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {16448#true} call ULTIMATE.init(); {16481#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:41,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {16481#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {16448#true} is VALID [2022-04-15 17:41:41,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16448#true} {16448#true} #780#return; {16448#true} is VALID [2022-04-15 17:41:41,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {16448#true} call #t~ret83 := main(); {16448#true} is VALID [2022-04-15 17:41:41,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {16448#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;~DevicePowerState~0 := 1;~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; {16448#true} is VALID [2022-04-15 17:41:41,568 INFO L272 TraceCheckUtils]: 6: Hoare triple {16448#true} call _BLAST_init(); {16482#(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-15 17:41:41,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {16482#(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; {16448#true} is VALID [2022-04-15 17:41:41,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,569 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {16448#true} {16448#true} #714#return; {16448#true} is VALID [2022-04-15 17:41:41,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {16448#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; {16448#true} is VALID [2022-04-15 17:41:41,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {16448#true} assume !(0 == ~irp_choice~0); {16448#true} is VALID [2022-04-15 17:41:41,569 INFO L272 TraceCheckUtils]: 12: Hoare triple {16448#true} call stub_driver_init(); {16483#(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-15 17:41:41,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {16483#(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; {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16448#true} {16448#true} #716#return; {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {16448#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {16448#true} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {16448#true} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {16448#true} assume 3 == ~tmp_ndt_3~0; {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L272 TraceCheckUtils]: 20: Hoare triple {16448#true} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {16448#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; {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {16448#true} assume 0 == ~irpStack__MinorFunction~0; {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {16448#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {16448#true} assume !(~s~0 != ~NP~0); {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {16448#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {16448#true} is VALID [2022-04-15 17:41:41,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {16448#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {16448#true} is VALID [2022-04-15 17:41:41,571 INFO L272 TraceCheckUtils]: 27: Hoare triple {16448#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {16484#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:41,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {16484#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {16448#true} is VALID [2022-04-15 17:41:41,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {16448#true} assume 0 != ~compRegistered~0; {16448#true} is VALID [2022-04-15 17:41:41,572 INFO L272 TraceCheckUtils]: 30: Hoare triple {16448#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {16495#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:41,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {16495#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {16448#true} is VALID [2022-04-15 17:41:41,572 INFO L272 TraceCheckUtils]: 32: Hoare triple {16448#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {16495#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:41,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {16495#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {16448#true} is VALID [2022-04-15 17:41:41,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,572 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16448#true} {16448#true} #712#return; {16448#true} is VALID [2022-04-15 17:41:41,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {16448#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {16448#true} is VALID [2022-04-15 17:41:41,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {16448#true} assume true; {16448#true} is VALID [2022-04-15 17:41:41,572 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {16448#true} {16448#true} #774#return; {16448#true} is VALID [2022-04-15 17:41:41,573 INFO L290 TraceCheckUtils]: 39: Hoare triple {16448#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {16448#true} is VALID [2022-04-15 17:41:41,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {16448#true} assume !(-1073741802 == ~__cil_tmp7~0); {16448#true} is VALID [2022-04-15 17:41:41,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {16448#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {16448#true} is VALID [2022-04-15 17:41:41,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {16448#true} assume 0 == ~tmp_ndt_6~0; {16448#true} is VALID [2022-04-15 17:41:41,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {16448#true} ~returnVal2~0 := 0; {16493#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:41,573 INFO L290 TraceCheckUtils]: 44: Hoare triple {16493#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {16493#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:41,574 INFO L290 TraceCheckUtils]: 45: Hoare triple {16493#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {16494#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 17:41:41,574 INFO L290 TraceCheckUtils]: 46: Hoare triple {16494#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} assume true; {16494#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 17:41:41,575 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16494#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} {16448#true} #752#return; {16479#(= |KbFilter_PnP_#t~ret12| 0)} is VALID [2022-04-15 17:41:41,575 INFO L290 TraceCheckUtils]: 48: Hoare triple {16479#(= |KbFilter_PnP_#t~ret12| 0)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {16480#(= KbFilter_PnP_~__cil_tmp23~0 0)} is VALID [2022-04-15 17:41:41,575 INFO L290 TraceCheckUtils]: 49: Hoare triple {16480#(= KbFilter_PnP_~__cil_tmp23~0 0)} assume 259 == ~__cil_tmp23~0; {16449#false} is VALID [2022-04-15 17:41:41,575 INFO L272 TraceCheckUtils]: 50: Hoare triple {16449#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {16449#false} is VALID [2022-04-15 17:41:41,575 INFO L290 TraceCheckUtils]: 51: Hoare triple {16449#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {16449#false} is VALID [2022-04-15 17:41:41,575 INFO L290 TraceCheckUtils]: 52: Hoare triple {16449#false} assume !(~s~0 == ~MPR3~0); {16449#false} is VALID [2022-04-15 17:41:41,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {16449#false} assume !(1 == ~customIrp~0); {16449#false} is VALID [2022-04-15 17:41:41,576 INFO L290 TraceCheckUtils]: 54: Hoare triple {16449#false} assume ~s~0 == ~MPR3~0; {16449#false} is VALID [2022-04-15 17:41:41,576 INFO L272 TraceCheckUtils]: 55: Hoare triple {16449#false} call errorFn(); {16449#false} is VALID [2022-04-15 17:41:41,576 INFO L290 TraceCheckUtils]: 56: Hoare triple {16449#false} assume !false; {16449#false} is VALID [2022-04-15 17:41:41,576 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-15 17:41:41,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:41,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525913439] [2022-04-15 17:41:41,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525913439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:41,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:41,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 17:41:41,577 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:41,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1466872554] [2022-04-15 17:41:41,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1466872554] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:41,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:41,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 17:41:41,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157498572] [2022-04-15 17:41:41,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:41,577 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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 57 [2022-04-15 17:41:41,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:41,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-15 17:41:41,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:41,608 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 17:41:41,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:41,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 17:41:41,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 17:41:41,608 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-15 17:41:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:42,385 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2022-04-15 17:41:42,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 17:41:42,386 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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 57 [2022-04-15 17:41:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-15 17:41:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2022-04-15 17:41:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-15 17:41:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2022-04-15 17:41:42,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 143 transitions. [2022-04-15 17:41:42,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:42,493 INFO L225 Difference]: With dead ends: 152 [2022-04-15 17:41:42,493 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 17:41:42,494 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:41:42,494 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 105 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:42,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 338 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:41:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 17:41:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-04-15 17:41:42,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:42,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 105 states, 80 states have (on average 1.1875) internal successors, (95), 81 states have internal predecessors, (95), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:41:42,604 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 105 states, 80 states have (on average 1.1875) internal successors, (95), 81 states have internal predecessors, (95), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:41:42,604 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 105 states, 80 states have (on average 1.1875) internal successors, (95), 81 states have internal predecessors, (95), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:41:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:42,605 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-04-15 17:41:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2022-04-15 17:41:42,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:42,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:42,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 80 states have (on average 1.1875) internal successors, (95), 81 states have internal predecessors, (95), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 111 states. [2022-04-15 17:41:42,606 INFO L87 Difference]: Start difference. First operand has 105 states, 80 states have (on average 1.1875) internal successors, (95), 81 states have internal predecessors, (95), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 111 states. [2022-04-15 17:41:42,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:42,607 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-04-15 17:41:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2022-04-15 17:41:42,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:42,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:42,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:42,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.1875) internal successors, (95), 81 states have internal predecessors, (95), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:41:42,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-04-15 17:41:42,609 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 57 [2022-04-15 17:41:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:42,609 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-04-15 17:41:42,609 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-15 17:41:42,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 119 transitions. [2022-04-15 17:41:42,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-04-15 17:41:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 17:41:42,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:42,727 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:42,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 17:41:42,727 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:42,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1324274632, now seen corresponding path program 1 times [2022-04-15 17:41:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:42,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [185814870] [2022-04-15 17:41:42,728 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1324274632, now seen corresponding path program 2 times [2022-04-15 17:41:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:42,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509574436] [2022-04-15 17:41:42,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:42,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:42,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:42,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {17272#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {17239#true} is VALID [2022-04-15 17:41:42,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,800 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17239#true} {17239#true} #780#return; {17239#true} is VALID [2022-04-15 17:41:42,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:42,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {17273#(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; {17239#true} is VALID [2022-04-15 17:41:42,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17239#true} {17239#true} #714#return; {17239#true} is VALID [2022-04-15 17:41:42,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:42,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {17274#(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; {17239#true} is VALID [2022-04-15 17:41:42,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17239#true} {17239#true} #716#return; {17239#true} is VALID [2022-04-15 17:41:42,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 17:41:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:42,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 17:41:42,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 17:41:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:42,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {17286#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {17239#true} is VALID [2022-04-15 17:41:42,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17239#true} {17239#true} #712#return; {17239#true} is VALID [2022-04-15 17:41:42,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {17286#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {17239#true} is VALID [2022-04-15 17:41:42,916 INFO L272 TraceCheckUtils]: 1: Hoare triple {17239#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {17286#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:42,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {17286#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {17239#true} is VALID [2022-04-15 17:41:42,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,917 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17239#true} {17239#true} #712#return; {17239#true} is VALID [2022-04-15 17:41:42,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {17239#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {17239#true} is VALID [2022-04-15 17:41:42,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,917 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17239#true} {17239#true} #774#return; {17239#true} is VALID [2022-04-15 17:41:42,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {17275#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {17239#true} is VALID [2022-04-15 17:41:42,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {17239#true} assume 0 != ~compRegistered~0; {17239#true} is VALID [2022-04-15 17:41:42,918 INFO L272 TraceCheckUtils]: 2: Hoare triple {17239#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {17286#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:42,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {17286#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {17239#true} is VALID [2022-04-15 17:41:42,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {17239#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {17286#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:42,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {17286#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {17239#true} is VALID [2022-04-15 17:41:42,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,919 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17239#true} {17239#true} #712#return; {17239#true} is VALID [2022-04-15 17:41:42,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {17239#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {17239#true} is VALID [2022-04-15 17:41:42,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,919 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17239#true} {17239#true} #774#return; {17239#true} is VALID [2022-04-15 17:41:42,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {17239#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {17239#true} is VALID [2022-04-15 17:41:42,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {17239#true} assume !(-1073741802 == ~__cil_tmp7~0); {17239#true} is VALID [2022-04-15 17:41:42,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {17239#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {17239#true} is VALID [2022-04-15 17:41:42,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {17239#true} assume 0 == ~tmp_ndt_6~0; {17239#true} is VALID [2022-04-15 17:41:42,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {17239#true} ~returnVal2~0 := 0; {17284#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:42,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {17284#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {17284#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:42,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {17284#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {17285#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 17:41:42,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {17285#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} assume true; {17285#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 17:41:42,921 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {17285#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} {17239#true} #752#return; {17270#(= |KbFilter_PnP_#t~ret12| 0)} is VALID [2022-04-15 17:41:42,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {17239#true} call ULTIMATE.init(); {17272#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:42,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {17272#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {17239#true} is VALID [2022-04-15 17:41:42,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17239#true} {17239#true} #780#return; {17239#true} is VALID [2022-04-15 17:41:42,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {17239#true} call #t~ret83 := main(); {17239#true} is VALID [2022-04-15 17:41:42,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {17239#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;~DevicePowerState~0 := 1;~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; {17239#true} is VALID [2022-04-15 17:41:42,924 INFO L272 TraceCheckUtils]: 6: Hoare triple {17239#true} call _BLAST_init(); {17273#(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-15 17:41:42,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {17273#(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; {17239#true} is VALID [2022-04-15 17:41:42,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,924 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {17239#true} {17239#true} #714#return; {17239#true} is VALID [2022-04-15 17:41:42,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {17239#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; {17239#true} is VALID [2022-04-15 17:41:42,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {17239#true} assume !(0 == ~irp_choice~0); {17239#true} is VALID [2022-04-15 17:41:42,925 INFO L272 TraceCheckUtils]: 12: Hoare triple {17239#true} call stub_driver_init(); {17274#(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-15 17:41:42,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {17274#(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; {17239#true} is VALID [2022-04-15 17:41:42,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,925 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17239#true} {17239#true} #716#return; {17239#true} is VALID [2022-04-15 17:41:42,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {17239#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {17239#true} is VALID [2022-04-15 17:41:42,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {17239#true} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {17239#true} is VALID [2022-04-15 17:41:42,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {17239#true} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {17239#true} is VALID [2022-04-15 17:41:42,925 INFO L290 TraceCheckUtils]: 19: Hoare triple {17239#true} assume 3 == ~tmp_ndt_3~0; {17239#true} is VALID [2022-04-15 17:41:42,926 INFO L272 TraceCheckUtils]: 20: Hoare triple {17239#true} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {17239#true} is VALID [2022-04-15 17:41:42,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {17239#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; {17239#true} is VALID [2022-04-15 17:41:42,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {17239#true} assume 0 == ~irpStack__MinorFunction~0; {17239#true} is VALID [2022-04-15 17:41:42,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {17239#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {17239#true} is VALID [2022-04-15 17:41:42,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {17239#true} assume !(~s~0 != ~NP~0); {17239#true} is VALID [2022-04-15 17:41:42,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {17239#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {17239#true} is VALID [2022-04-15 17:41:42,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {17239#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {17239#true} is VALID [2022-04-15 17:41:42,927 INFO L272 TraceCheckUtils]: 27: Hoare triple {17239#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {17275#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:42,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {17275#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {17239#true} is VALID [2022-04-15 17:41:42,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {17239#true} assume 0 != ~compRegistered~0; {17239#true} is VALID [2022-04-15 17:41:42,927 INFO L272 TraceCheckUtils]: 30: Hoare triple {17239#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {17286#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:42,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {17286#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {17239#true} is VALID [2022-04-15 17:41:42,928 INFO L272 TraceCheckUtils]: 32: Hoare triple {17239#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {17286#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:42,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {17286#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {17239#true} is VALID [2022-04-15 17:41:42,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,928 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {17239#true} {17239#true} #712#return; {17239#true} is VALID [2022-04-15 17:41:42,928 INFO L290 TraceCheckUtils]: 36: Hoare triple {17239#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {17239#true} is VALID [2022-04-15 17:41:42,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {17239#true} assume true; {17239#true} is VALID [2022-04-15 17:41:42,929 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {17239#true} {17239#true} #774#return; {17239#true} is VALID [2022-04-15 17:41:42,929 INFO L290 TraceCheckUtils]: 39: Hoare triple {17239#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {17239#true} is VALID [2022-04-15 17:41:42,929 INFO L290 TraceCheckUtils]: 40: Hoare triple {17239#true} assume !(-1073741802 == ~__cil_tmp7~0); {17239#true} is VALID [2022-04-15 17:41:42,929 INFO L290 TraceCheckUtils]: 41: Hoare triple {17239#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {17239#true} is VALID [2022-04-15 17:41:42,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {17239#true} assume 0 == ~tmp_ndt_6~0; {17239#true} is VALID [2022-04-15 17:41:42,929 INFO L290 TraceCheckUtils]: 43: Hoare triple {17239#true} ~returnVal2~0 := 0; {17284#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:42,930 INFO L290 TraceCheckUtils]: 44: Hoare triple {17284#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {17284#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:42,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {17284#(and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {17285#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 17:41:42,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {17285#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} assume true; {17285#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} is VALID [2022-04-15 17:41:42,931 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17285#(and (<= 0 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 0))} {17239#true} #752#return; {17270#(= |KbFilter_PnP_#t~ret12| 0)} is VALID [2022-04-15 17:41:42,932 INFO L290 TraceCheckUtils]: 48: Hoare triple {17270#(= |KbFilter_PnP_#t~ret12| 0)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {17271#(= KbFilter_PnP_~status~0 0)} is VALID [2022-04-15 17:41:42,932 INFO L290 TraceCheckUtils]: 49: Hoare triple {17271#(= KbFilter_PnP_~status~0 0)} assume !(259 == ~__cil_tmp23~0); {17271#(= KbFilter_PnP_~status~0 0)} is VALID [2022-04-15 17:41:42,932 INFO L290 TraceCheckUtils]: 50: Hoare triple {17271#(= KbFilter_PnP_~status~0 0)} assume !(~status~0 >= 0); {17240#false} is VALID [2022-04-15 17:41:42,932 INFO L290 TraceCheckUtils]: 51: Hoare triple {17240#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {17240#false} is VALID [2022-04-15 17:41:42,932 INFO L272 TraceCheckUtils]: 52: Hoare triple {17240#false} call IofCompleteRequest(~Irp, 0); {17240#false} is VALID [2022-04-15 17:41:42,933 INFO L290 TraceCheckUtils]: 53: Hoare triple {17240#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {17240#false} is VALID [2022-04-15 17:41:42,933 INFO L290 TraceCheckUtils]: 54: Hoare triple {17240#false} assume !(~s~0 == ~NP~0); {17240#false} is VALID [2022-04-15 17:41:42,933 INFO L272 TraceCheckUtils]: 55: Hoare triple {17240#false} call errorFn(); {17240#false} is VALID [2022-04-15 17:41:42,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {17240#false} assume !false; {17240#false} is VALID [2022-04-15 17:41:42,933 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-15 17:41:42,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:42,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509574436] [2022-04-15 17:41:42,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509574436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:42,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:42,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 17:41:42,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:42,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [185814870] [2022-04-15 17:41:42,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [185814870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:42,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:42,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 17:41:42,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896392552] [2022-04-15 17:41:42,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:42,934 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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 57 [2022-04-15 17:41:42,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:42,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-15 17:41:42,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:42,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 17:41:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 17:41:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 17:41:42,980 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-15 17:41:43,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:43,737 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2022-04-15 17:41:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 17:41:43,737 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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 57 [2022-04-15 17:41:43,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-15 17:41:43,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-04-15 17:41:43,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-15 17:41:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-04-15 17:41:43,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 111 transitions. [2022-04-15 17:41:43,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:43,839 INFO L225 Difference]: With dead ends: 116 [2022-04-15 17:41:43,839 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 17:41:43,840 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-15 17:41:43,840 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 82 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:43,840 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 304 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:41:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 17:41:43,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2022-04-15 17:41:43,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:43,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 106 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 82 states have internal predecessors, (96), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:41:43,957 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 106 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 82 states have internal predecessors, (96), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:41:43,957 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 106 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 82 states have internal predecessors, (96), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:41:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:43,958 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2022-04-15 17:41:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2022-04-15 17:41:43,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:43,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:43,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 82 states have internal predecessors, (96), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 109 states. [2022-04-15 17:41:43,959 INFO L87 Difference]: Start difference. First operand has 106 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 82 states have internal predecessors, (96), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 109 states. [2022-04-15 17:41:43,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:43,960 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2022-04-15 17:41:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2022-04-15 17:41:43,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:43,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:43,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:43,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:43,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 82 states have internal predecessors, (96), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:41:43,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2022-04-15 17:41:43,961 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 57 [2022-04-15 17:41:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:43,962 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2022-04-15 17:41:43,962 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 5 states have internal predecessors, (41), 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-15 17:41:43,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 120 transitions. [2022-04-15 17:41:44,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2022-04-15 17:41:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 17:41:44,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:44,093 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:44,094 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 17:41:44,094 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:44,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2097337179, now seen corresponding path program 1 times [2022-04-15 17:41:44,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:44,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1030225742] [2022-04-15 17:41:44,094 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:44,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2097337179, now seen corresponding path program 2 times [2022-04-15 17:41:44,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:44,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234121119] [2022-04-15 17:41:44,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:44,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:44,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:44,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {17993#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {17962#true} is VALID [2022-04-15 17:41:44,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {17962#true} assume true; {17962#true} is VALID [2022-04-15 17:41:44,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17962#true} {17962#true} #780#return; {17962#true} is VALID [2022-04-15 17:41:44,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:44,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {17994#(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; {17962#true} is VALID [2022-04-15 17:41:44,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {17962#true} assume true; {17962#true} is VALID [2022-04-15 17:41:44,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17962#true} {17962#true} #714#return; {17962#true} is VALID [2022-04-15 17:41:44,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:44,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:44,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {17995#(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; {17962#true} is VALID [2022-04-15 17:41:44,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {17962#true} assume true; {17962#true} is VALID [2022-04-15 17:41:44,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17962#true} {17962#true} #716#return; {17962#true} is VALID [2022-04-15 17:41:44,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 17:41:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:44,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 17:41:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:44,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 17:41:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:44,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {18007#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {17962#true} is VALID [2022-04-15 17:41:44,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {17962#true} assume true; {17962#true} is VALID [2022-04-15 17:41:44,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17962#true} {17962#true} #712#return; {17962#true} is VALID [2022-04-15 17:41:44,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {18007#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {17962#true} is VALID [2022-04-15 17:41:44,281 INFO L272 TraceCheckUtils]: 1: Hoare triple {17962#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {18007#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:44,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {18007#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {17962#true} is VALID [2022-04-15 17:41:44,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {17962#true} assume true; {17962#true} is VALID [2022-04-15 17:41:44,281 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17962#true} {17962#true} #712#return; {17962#true} is VALID [2022-04-15 17:41:44,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {17962#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {18011#(and (<= (+ 1073741802 |KbFilter_Complete_#res|) 0) (<= 0 (+ 1073741802 |KbFilter_Complete_#res|)))} is VALID [2022-04-15 17:41:44,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {18011#(and (<= (+ 1073741802 |KbFilter_Complete_#res|) 0) (<= 0 (+ 1073741802 |KbFilter_Complete_#res|)))} assume true; {18011#(and (<= (+ 1073741802 |KbFilter_Complete_#res|) 0) (<= 0 (+ 1073741802 |KbFilter_Complete_#res|)))} is VALID [2022-04-15 17:41:44,287 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18011#(and (<= (+ 1073741802 |KbFilter_Complete_#res|) 0) (<= 0 (+ 1073741802 |KbFilter_Complete_#res|)))} {17962#true} #774#return; {18005#(= (+ |IofCallDriver_#t~ret37| 1073741802) 0)} is VALID [2022-04-15 17:41:44,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {17996#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {17962#true} is VALID [2022-04-15 17:41:44,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {17962#true} assume 0 != ~compRegistered~0; {17962#true} is VALID [2022-04-15 17:41:44,287 INFO L272 TraceCheckUtils]: 2: Hoare triple {17962#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {18007#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:44,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {18007#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {17962#true} is VALID [2022-04-15 17:41:44,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {17962#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {18007#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:44,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {18007#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {17962#true} is VALID [2022-04-15 17:41:44,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {17962#true} assume true; {17962#true} is VALID [2022-04-15 17:41:44,288 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17962#true} {17962#true} #712#return; {17962#true} is VALID [2022-04-15 17:41:44,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {17962#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {18011#(and (<= (+ 1073741802 |KbFilter_Complete_#res|) 0) (<= 0 (+ 1073741802 |KbFilter_Complete_#res|)))} is VALID [2022-04-15 17:41:44,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {18011#(and (<= (+ 1073741802 |KbFilter_Complete_#res|) 0) (<= 0 (+ 1073741802 |KbFilter_Complete_#res|)))} assume true; {18011#(and (<= (+ 1073741802 |KbFilter_Complete_#res|) 0) (<= 0 (+ 1073741802 |KbFilter_Complete_#res|)))} is VALID [2022-04-15 17:41:44,290 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18011#(and (<= (+ 1073741802 |KbFilter_Complete_#res|) 0) (<= 0 (+ 1073741802 |KbFilter_Complete_#res|)))} {17962#true} #774#return; {18005#(= (+ |IofCallDriver_#t~ret37| 1073741802) 0)} is VALID [2022-04-15 17:41:44,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {18005#(= (+ |IofCallDriver_#t~ret37| 1073741802) 0)} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {18006#(= IofCallDriver_~__cil_tmp7~0 (- 1073741802))} is VALID [2022-04-15 17:41:44,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {18006#(= IofCallDriver_~__cil_tmp7~0 (- 1073741802))} assume !(-1073741802 == ~__cil_tmp7~0); {17963#false} is VALID [2022-04-15 17:41:44,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {17963#false} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {17963#false} is VALID [2022-04-15 17:41:44,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {17963#false} assume 0 == ~tmp_ndt_6~0; {17963#false} is VALID [2022-04-15 17:41:44,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {17963#false} ~returnVal2~0 := 0; {17963#false} is VALID [2022-04-15 17:41:44,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {17963#false} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {17963#false} is VALID [2022-04-15 17:41:44,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {17963#false} #res := ~returnVal2~0; {17963#false} is VALID [2022-04-15 17:41:44,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {17963#false} assume true; {17963#false} is VALID [2022-04-15 17:41:44,291 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {17963#false} {17962#true} #752#return; {17963#false} is VALID [2022-04-15 17:41:44,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {17962#true} call ULTIMATE.init(); {17993#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:44,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {17993#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {17962#true} is VALID [2022-04-15 17:41:44,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {17962#true} assume true; {17962#true} is VALID [2022-04-15 17:41:44,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17962#true} {17962#true} #780#return; {17962#true} is VALID [2022-04-15 17:41:44,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {17962#true} call #t~ret83 := main(); {17962#true} is VALID [2022-04-15 17:41:44,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {17962#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;~DevicePowerState~0 := 1;~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; {17962#true} is VALID [2022-04-15 17:41:44,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {17962#true} call _BLAST_init(); {17994#(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-15 17:41:44,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {17994#(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; {17962#true} is VALID [2022-04-15 17:41:44,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {17962#true} assume true; {17962#true} is VALID [2022-04-15 17:41:44,294 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {17962#true} {17962#true} #714#return; {17962#true} is VALID [2022-04-15 17:41:44,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {17962#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; {17962#true} is VALID [2022-04-15 17:41:44,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {17962#true} assume !(0 == ~irp_choice~0); {17962#true} is VALID [2022-04-15 17:41:44,295 INFO L272 TraceCheckUtils]: 12: Hoare triple {17962#true} call stub_driver_init(); {17995#(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-15 17:41:44,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {17995#(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; {17962#true} is VALID [2022-04-15 17:41:44,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {17962#true} assume true; {17962#true} is VALID [2022-04-15 17:41:44,295 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17962#true} {17962#true} #716#return; {17962#true} is VALID [2022-04-15 17:41:44,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {17962#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {17962#true} is VALID [2022-04-15 17:41:44,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {17962#true} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {17962#true} is VALID [2022-04-15 17:41:44,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {17962#true} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {17962#true} is VALID [2022-04-15 17:41:44,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {17962#true} assume 3 == ~tmp_ndt_3~0; {17962#true} is VALID [2022-04-15 17:41:44,296 INFO L272 TraceCheckUtils]: 20: Hoare triple {17962#true} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {17962#true} is VALID [2022-04-15 17:41:44,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {17962#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; {17962#true} is VALID [2022-04-15 17:41:44,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {17962#true} assume 0 == ~irpStack__MinorFunction~0; {17962#true} is VALID [2022-04-15 17:41:44,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {17962#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {17962#true} is VALID [2022-04-15 17:41:44,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {17962#true} assume !(~s~0 != ~NP~0); {17962#true} is VALID [2022-04-15 17:41:44,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {17962#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {17962#true} is VALID [2022-04-15 17:41:44,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {17962#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {17962#true} is VALID [2022-04-15 17:41:44,297 INFO L272 TraceCheckUtils]: 27: Hoare triple {17962#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {17996#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:44,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {17996#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {17962#true} is VALID [2022-04-15 17:41:44,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {17962#true} assume 0 != ~compRegistered~0; {17962#true} is VALID [2022-04-15 17:41:44,297 INFO L272 TraceCheckUtils]: 30: Hoare triple {17962#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {18007#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:44,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {18007#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {17962#true} is VALID [2022-04-15 17:41:44,298 INFO L272 TraceCheckUtils]: 32: Hoare triple {17962#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {18007#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:44,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {18007#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {17962#true} is VALID [2022-04-15 17:41:44,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {17962#true} assume true; {17962#true} is VALID [2022-04-15 17:41:44,298 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {17962#true} {17962#true} #712#return; {17962#true} is VALID [2022-04-15 17:41:44,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {17962#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {18011#(and (<= (+ 1073741802 |KbFilter_Complete_#res|) 0) (<= 0 (+ 1073741802 |KbFilter_Complete_#res|)))} is VALID [2022-04-15 17:41:44,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {18011#(and (<= (+ 1073741802 |KbFilter_Complete_#res|) 0) (<= 0 (+ 1073741802 |KbFilter_Complete_#res|)))} assume true; {18011#(and (<= (+ 1073741802 |KbFilter_Complete_#res|) 0) (<= 0 (+ 1073741802 |KbFilter_Complete_#res|)))} is VALID [2022-04-15 17:41:44,300 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {18011#(and (<= (+ 1073741802 |KbFilter_Complete_#res|) 0) (<= 0 (+ 1073741802 |KbFilter_Complete_#res|)))} {17962#true} #774#return; {18005#(= (+ |IofCallDriver_#t~ret37| 1073741802) 0)} is VALID [2022-04-15 17:41:44,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {18005#(= (+ |IofCallDriver_#t~ret37| 1073741802) 0)} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {18006#(= IofCallDriver_~__cil_tmp7~0 (- 1073741802))} is VALID [2022-04-15 17:41:44,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {18006#(= IofCallDriver_~__cil_tmp7~0 (- 1073741802))} assume !(-1073741802 == ~__cil_tmp7~0); {17963#false} is VALID [2022-04-15 17:41:44,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {17963#false} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {17963#false} is VALID [2022-04-15 17:41:44,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {17963#false} assume 0 == ~tmp_ndt_6~0; {17963#false} is VALID [2022-04-15 17:41:44,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {17963#false} ~returnVal2~0 := 0; {17963#false} is VALID [2022-04-15 17:41:44,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {17963#false} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {17963#false} #res := ~returnVal2~0; {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L290 TraceCheckUtils]: 46: Hoare triple {17963#false} assume true; {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17963#false} {17962#true} #752#return; {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {17963#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {17963#false} assume !(259 == ~__cil_tmp23~0); {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {17963#false} assume ~status~0 >= 0; {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L290 TraceCheckUtils]: 51: Hoare triple {17963#false} assume ~myStatus~0 >= 0;~devExt__Started~0 := 1;~devExt__Removed~0 := 0;~devExt__SurpriseRemoved~0 := 0; {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L290 TraceCheckUtils]: 52: Hoare triple {17963#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L272 TraceCheckUtils]: 53: Hoare triple {17963#false} call IofCompleteRequest(~Irp, 0); {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L290 TraceCheckUtils]: 54: Hoare triple {17963#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L290 TraceCheckUtils]: 55: Hoare triple {17963#false} assume !(~s~0 == ~NP~0); {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L272 TraceCheckUtils]: 56: Hoare triple {17963#false} call errorFn(); {17963#false} is VALID [2022-04-15 17:41:44,301 INFO L290 TraceCheckUtils]: 57: Hoare triple {17963#false} assume !false; {17963#false} is VALID [2022-04-15 17:41:44,302 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-15 17:41:44,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:44,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234121119] [2022-04-15 17:41:44,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234121119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:44,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:44,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 17:41:44,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:44,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1030225742] [2022-04-15 17:41:44,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1030225742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:44,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:44,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 17:41:44,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181172097] [2022-04-15 17:41:44,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:44,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-04-15 17:41:44,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:44,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 17:41:44,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:44,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 17:41:44,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:44,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 17:41:44,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-15 17:41:44,347 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 17:41:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:44,952 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2022-04-15 17:41:44,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 17:41:44,952 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-04-15 17:41:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 17:41:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2022-04-15 17:41:44,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 17:41:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2022-04-15 17:41:44,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 135 transitions. [2022-04-15 17:41:45,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:45,052 INFO L225 Difference]: With dead ends: 142 [2022-04-15 17:41:45,052 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 17:41:45,052 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-15 17:41:45,053 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 65 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:45,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 268 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:41:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 17:41:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-15 17:41:45,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:45,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 75 states have (on average 1.16) internal successors, (87), 76 states have internal predecessors, (87), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:41:45,150 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 75 states have (on average 1.16) internal successors, (87), 76 states have internal predecessors, (87), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:41:45,150 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 75 states have (on average 1.16) internal successors, (87), 76 states have internal predecessors, (87), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:41:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:45,151 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2022-04-15 17:41:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-04-15 17:41:45,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:45,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:45,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 75 states have (on average 1.16) internal successors, (87), 76 states have internal predecessors, (87), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 100 states. [2022-04-15 17:41:45,152 INFO L87 Difference]: Start difference. First operand has 100 states, 75 states have (on average 1.16) internal successors, (87), 76 states have internal predecessors, (87), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) Second operand 100 states. [2022-04-15 17:41:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:45,153 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2022-04-15 17:41:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-04-15 17:41:45,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:45,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:45,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:45,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.16) internal successors, (87), 76 states have internal predecessors, (87), 14 states have call successors, (14), 13 states have call predecessors, (14), 10 states have return successors, (10), 10 states have call predecessors, (10), 8 states have call successors, (10) [2022-04-15 17:41:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2022-04-15 17:41:45,154 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 58 [2022-04-15 17:41:45,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:45,154 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2022-04-15 17:41:45,154 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-15 17:41:45,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 111 transitions. [2022-04-15 17:41:45,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-04-15 17:41:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 17:41:45,272 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:45,272 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:45,273 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 17:41:45,273 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:45,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1424142412, now seen corresponding path program 1 times [2022-04-15 17:41:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:45,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1142425229] [2022-04-15 17:41:45,273 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:45,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1424142412, now seen corresponding path program 2 times [2022-04-15 17:41:45,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:45,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548064643] [2022-04-15 17:41:45,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:45,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:45,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:45,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {18734#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {18698#true} is VALID [2022-04-15 17:41:45,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {18698#true} assume true; {18698#true} is VALID [2022-04-15 17:41:45,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18698#true} {18698#true} #780#return; {18698#true} is VALID [2022-04-15 17:41:45,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:45,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {18735#(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; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume true; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} {18698#true} #714#return; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:45,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {18736#(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; {18698#true} is VALID [2022-04-15 17:41:45,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {18698#true} assume true; {18698#true} is VALID [2022-04-15 17:41:45,394 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18698#true} {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #716#return; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 17:41:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:45,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 17:41:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:45,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 17:41:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:45,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {18751#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {18698#true} is VALID [2022-04-15 17:41:45,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {18698#true} assume true; {18698#true} is VALID [2022-04-15 17:41:45,437 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18698#true} {18698#true} #712#return; {18698#true} is VALID [2022-04-15 17:41:45,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {18751#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {18698#true} is VALID [2022-04-15 17:41:45,437 INFO L272 TraceCheckUtils]: 1: Hoare triple {18698#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {18751#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:45,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {18751#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {18698#true} is VALID [2022-04-15 17:41:45,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {18698#true} assume true; {18698#true} is VALID [2022-04-15 17:41:45,438 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18698#true} {18698#true} #712#return; {18698#true} is VALID [2022-04-15 17:41:45,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {18698#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {18698#true} is VALID [2022-04-15 17:41:45,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {18698#true} assume true; {18698#true} is VALID [2022-04-15 17:41:45,438 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18698#true} {18698#true} #774#return; {18698#true} is VALID [2022-04-15 17:41:45,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 17:41:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:45,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {18755#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {18756#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 17:41:45,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {18756#(= ~MPR1~0 ~s~0)} assume true; {18756#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 17:41:45,451 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18756#(= ~MPR1~0 ~s~0)} {18698#true} #776#return; {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 17:41:45,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {18737#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {18698#true} is VALID [2022-04-15 17:41:45,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {18698#true} assume 0 != ~compRegistered~0; {18698#true} is VALID [2022-04-15 17:41:45,452 INFO L272 TraceCheckUtils]: 2: Hoare triple {18698#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {18751#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:45,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {18751#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {18698#true} is VALID [2022-04-15 17:41:45,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {18698#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {18751#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:45,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {18751#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {18698#true} is VALID [2022-04-15 17:41:45,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {18698#true} assume true; {18698#true} is VALID [2022-04-15 17:41:45,453 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18698#true} {18698#true} #712#return; {18698#true} is VALID [2022-04-15 17:41:45,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {18698#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {18698#true} is VALID [2022-04-15 17:41:45,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {18698#true} assume true; {18698#true} is VALID [2022-04-15 17:41:45,453 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18698#true} {18698#true} #774#return; {18698#true} is VALID [2022-04-15 17:41:45,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {18698#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {18698#true} is VALID [2022-04-15 17:41:45,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {18698#true} assume -1073741802 == ~__cil_tmp7~0; {18698#true} is VALID [2022-04-15 17:41:45,453 INFO L272 TraceCheckUtils]: 13: Hoare triple {18698#true} call stubMoreProcessingRequired(); {18755#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:45,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {18755#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {18756#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 17:41:45,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {18756#(= ~MPR1~0 ~s~0)} assume true; {18756#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 17:41:45,454 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {18756#(= ~MPR1~0 ~s~0)} {18698#true} #776#return; {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 17:41:45,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 17:41:45,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume 0 == ~tmp_ndt_6~0; {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 17:41:45,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} ~returnVal2~0 := 0; {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 17:41:45,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {18750#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-15 17:41:45,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {18750#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} #res := ~returnVal2~0; {18750#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-15 17:41:45,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {18750#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} assume true; {18750#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-15 17:41:45,456 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18750#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #752#return; {18699#false} is VALID [2022-04-15 17:41:45,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {18698#true} call ULTIMATE.init(); {18734#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:45,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {18734#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {18698#true} is VALID [2022-04-15 17:41:45,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {18698#true} assume true; {18698#true} is VALID [2022-04-15 17:41:45,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18698#true} {18698#true} #780#return; {18698#true} is VALID [2022-04-15 17:41:45,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {18698#true} call #t~ret83 := main(); {18698#true} is VALID [2022-04-15 17:41:45,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {18698#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;~DevicePowerState~0 := 1;~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; {18698#true} is VALID [2022-04-15 17:41:45,459 INFO L272 TraceCheckUtils]: 6: Hoare triple {18698#true} call _BLAST_init(); {18735#(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-15 17:41:45,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {18735#(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; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume true; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,460 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} {18698#true} #714#return; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {18706#(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; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(0 == ~irp_choice~0); {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,461 INFO L272 TraceCheckUtils]: 12: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call stub_driver_init(); {18736#(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-15 17:41:45,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {18736#(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; {18698#true} is VALID [2022-04-15 17:41:45,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {18698#true} assume true; {18698#true} is VALID [2022-04-15 17:41:45,462 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18698#true} {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #716#return; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 3 == ~tmp_ndt_3~0; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,463 INFO L272 TraceCheckUtils]: 20: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {18706#(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; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume 0 == ~irpStack__MinorFunction~0; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {18706#(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; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(~s~0 != ~NP~0); {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} is VALID [2022-04-15 17:41:45,466 INFO L272 TraceCheckUtils]: 27: Hoare triple {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {18737#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:45,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {18737#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {18698#true} is VALID [2022-04-15 17:41:45,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {18698#true} assume 0 != ~compRegistered~0; {18698#true} is VALID [2022-04-15 17:41:45,467 INFO L272 TraceCheckUtils]: 30: Hoare triple {18698#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {18751#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:45,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {18751#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {18698#true} is VALID [2022-04-15 17:41:45,467 INFO L272 TraceCheckUtils]: 32: Hoare triple {18698#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {18751#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:45,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {18751#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {18698#true} is VALID [2022-04-15 17:41:45,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {18698#true} assume true; {18698#true} is VALID [2022-04-15 17:41:45,467 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18698#true} {18698#true} #712#return; {18698#true} is VALID [2022-04-15 17:41:45,467 INFO L290 TraceCheckUtils]: 36: Hoare triple {18698#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {18698#true} is VALID [2022-04-15 17:41:45,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {18698#true} assume true; {18698#true} is VALID [2022-04-15 17:41:45,468 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {18698#true} {18698#true} #774#return; {18698#true} is VALID [2022-04-15 17:41:45,468 INFO L290 TraceCheckUtils]: 39: Hoare triple {18698#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {18698#true} is VALID [2022-04-15 17:41:45,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {18698#true} assume -1073741802 == ~__cil_tmp7~0; {18698#true} is VALID [2022-04-15 17:41:45,468 INFO L272 TraceCheckUtils]: 41: Hoare triple {18698#true} call stubMoreProcessingRequired(); {18755#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:45,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {18755#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {18756#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 17:41:45,468 INFO L290 TraceCheckUtils]: 43: Hoare triple {18756#(= ~MPR1~0 ~s~0)} assume true; {18756#(= ~MPR1~0 ~s~0)} is VALID [2022-04-15 17:41:45,469 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {18756#(= ~MPR1~0 ~s~0)} {18698#true} #776#return; {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 17:41:45,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 17:41:45,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume 0 == ~tmp_ndt_6~0; {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 17:41:45,470 INFO L290 TraceCheckUtils]: 47: Hoare triple {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} ~returnVal2~0 := 0; {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} is VALID [2022-04-15 17:41:45,470 INFO L290 TraceCheckUtils]: 48: Hoare triple {18749#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~s~0))} assume ~s~0 == ~NP~0;~s~0 := ~IPC~0;~lowerDriverReturn~0 := ~returnVal2~0; {18750#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-15 17:41:45,470 INFO L290 TraceCheckUtils]: 49: Hoare triple {18750#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} #res := ~returnVal2~0; {18750#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-15 17:41:45,470 INFO L290 TraceCheckUtils]: 50: Hoare triple {18750#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} assume true; {18750#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} is VALID [2022-04-15 17:41:45,471 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {18750#(or (= (+ (- 1) ~MPR1~0) 0) (= ~MPR1~0 ~NP~0))} {18706#(and (<= 5 ~MPR1~0) (= ~NP~0 1))} #752#return; {18699#false} is VALID [2022-04-15 17:41:45,471 INFO L290 TraceCheckUtils]: 52: Hoare triple {18699#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {18699#false} is VALID [2022-04-15 17:41:45,471 INFO L290 TraceCheckUtils]: 53: Hoare triple {18699#false} assume !(259 == ~__cil_tmp23~0); {18699#false} is VALID [2022-04-15 17:41:45,471 INFO L290 TraceCheckUtils]: 54: Hoare triple {18699#false} assume ~status~0 >= 0; {18699#false} is VALID [2022-04-15 17:41:45,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {18699#false} assume ~myStatus~0 >= 0;~devExt__Started~0 := 1;~devExt__Removed~0 := 0;~devExt__SurpriseRemoved~0 := 0; {18699#false} is VALID [2022-04-15 17:41:45,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {18699#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {18699#false} is VALID [2022-04-15 17:41:45,472 INFO L272 TraceCheckUtils]: 57: Hoare triple {18699#false} call IofCompleteRequest(~Irp, 0); {18699#false} is VALID [2022-04-15 17:41:45,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {18699#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {18699#false} is VALID [2022-04-15 17:41:45,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {18699#false} assume !(~s~0 == ~NP~0); {18699#false} is VALID [2022-04-15 17:41:45,472 INFO L272 TraceCheckUtils]: 60: Hoare triple {18699#false} call errorFn(); {18699#false} is VALID [2022-04-15 17:41:45,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {18699#false} assume !false; {18699#false} is VALID [2022-04-15 17:41:45,472 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-15 17:41:45,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:45,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548064643] [2022-04-15 17:41:45,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548064643] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:45,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:45,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:41:45,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:45,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1142425229] [2022-04-15 17:41:45,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1142425229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:45,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:45,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:41:45,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655867751] [2022-04-15 17:41:45,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:45,473 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 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 62 [2022-04-15 17:41:45,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:45,474 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), 6 states have internal predecessors, (44), 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-15 17:41:45,507 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-15 17:41:45,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 17:41:45,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:45,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 17:41:45,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:41:45,508 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 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-15 17:41:46,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:46,334 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2022-04-15 17:41:46,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 17:41:46,335 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 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 62 [2022-04-15 17:41:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 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-15 17:41:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2022-04-15 17:41:46,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 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-15 17:41:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2022-04-15 17:41:46,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 125 transitions. [2022-04-15 17:41:46,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:46,433 INFO L225 Difference]: With dead ends: 128 [2022-04-15 17:41:46,433 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 17:41:46,434 INFO L912 BasicCegarLoop]: 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-15 17:41:46,434 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 153 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:46,434 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 202 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:41:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 17:41:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-15 17:41:46,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:46,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 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-15 17:41:46,561 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 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-15 17:41:46,562 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 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-15 17:41:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:46,563 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-15 17:41:46,563 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-15 17:41:46,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:46,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:46,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 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 92 states. [2022-04-15 17:41:46,563 INFO L87 Difference]: Start difference. First operand has 92 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 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 92 states. [2022-04-15 17:41:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:46,564 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-15 17:41:46,564 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-15 17:41:46,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:46,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:46,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:46,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 69 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-15 17:41:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-04-15 17:41:46,566 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 62 [2022-04-15 17:41:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:46,566 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-04-15 17:41:46,566 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 6 states have internal predecessors, (44), 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-15 17:41:46,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 101 transitions. [2022-04-15 17:41:46,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-15 17:41:46,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 17:41:46,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:46,691 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:46,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 17:41:46,691 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash -119468725, now seen corresponding path program 1 times [2022-04-15 17:41:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:46,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [346900803] [2022-04-15 17:41:46,692 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash -119468725, now seen corresponding path program 2 times [2022-04-15 17:41:46,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:46,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717819891] [2022-04-15 17:41:46,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:46,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:46,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:46,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:46,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {19437#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {19399#true} is VALID [2022-04-15 17:41:46,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19399#true} {19399#true} #780#return; {19399#true} is VALID [2022-04-15 17:41:46,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:46,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {19438#(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; {19399#true} is VALID [2022-04-15 17:41:46,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,772 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19399#true} {19399#true} #714#return; {19399#true} is VALID [2022-04-15 17:41:46,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:46,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {19439#(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; {19399#true} is VALID [2022-04-15 17:41:46,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19399#true} {19399#true} #716#return; {19399#true} is VALID [2022-04-15 17:41:46,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 17:41:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:46,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 17:41:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 17:41:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:46,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {19453#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {19399#true} is VALID [2022-04-15 17:41:46,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19399#true} {19399#true} #712#return; {19399#true} is VALID [2022-04-15 17:41:46,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {19453#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {19399#true} is VALID [2022-04-15 17:41:46,823 INFO L272 TraceCheckUtils]: 1: Hoare triple {19399#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {19453#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:46,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {19453#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {19399#true} is VALID [2022-04-15 17:41:46,823 INFO L290 TraceCheckUtils]: 3: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,823 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19399#true} {19399#true} #712#return; {19399#true} is VALID [2022-04-15 17:41:46,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {19399#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {19399#true} is VALID [2022-04-15 17:41:46,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,824 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19399#true} {19399#true} #774#return; {19399#true} is VALID [2022-04-15 17:41:46,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 17:41:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:46,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {19457#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {19399#true} is VALID [2022-04-15 17:41:46,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19399#true} {19399#true} #776#return; {19399#true} is VALID [2022-04-15 17:41:46,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {19440#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {19399#true} is VALID [2022-04-15 17:41:46,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {19399#true} assume 0 != ~compRegistered~0; {19399#true} is VALID [2022-04-15 17:41:46,831 INFO L272 TraceCheckUtils]: 2: Hoare triple {19399#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {19453#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:46,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {19453#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {19399#true} is VALID [2022-04-15 17:41:46,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {19399#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {19453#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:46,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {19453#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {19399#true} is VALID [2022-04-15 17:41:46,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,832 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19399#true} {19399#true} #712#return; {19399#true} is VALID [2022-04-15 17:41:46,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {19399#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {19399#true} is VALID [2022-04-15 17:41:46,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,832 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19399#true} {19399#true} #774#return; {19399#true} is VALID [2022-04-15 17:41:46,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {19399#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {19399#true} is VALID [2022-04-15 17:41:46,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {19399#true} assume -1073741802 == ~__cil_tmp7~0; {19399#true} is VALID [2022-04-15 17:41:46,832 INFO L272 TraceCheckUtils]: 13: Hoare triple {19399#true} call stubMoreProcessingRequired(); {19457#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:46,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {19457#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {19399#true} is VALID [2022-04-15 17:41:46,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,832 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {19399#true} {19399#true} #776#return; {19399#true} is VALID [2022-04-15 17:41:46,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {19399#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {19399#true} is VALID [2022-04-15 17:41:46,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {19399#true} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {19399#true} is VALID [2022-04-15 17:41:46,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {19399#true} assume 1 == ~tmp_ndt_7~0; {19399#true} is VALID [2022-04-15 17:41:46,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {19399#true} ~returnVal2~0 := -1073741823; {19452#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 17:41:46,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {19452#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume !(~s~0 == ~NP~0); {19452#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 17:41:46,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {19452#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume ~s~0 == ~MPR1~0; {19452#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 17:41:46,834 INFO L290 TraceCheckUtils]: 23: Hoare triple {19452#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {19400#false} is VALID [2022-04-15 17:41:46,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {19400#false} #res := ~returnVal2~0; {19400#false} is VALID [2022-04-15 17:41:46,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {19400#false} assume true; {19400#false} is VALID [2022-04-15 17:41:46,834 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {19400#false} {19399#true} #752#return; {19400#false} is VALID [2022-04-15 17:41:46,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {19399#true} call ULTIMATE.init(); {19437#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:46,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {19437#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {19399#true} is VALID [2022-04-15 17:41:46,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19399#true} {19399#true} #780#return; {19399#true} is VALID [2022-04-15 17:41:46,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {19399#true} call #t~ret83 := main(); {19399#true} is VALID [2022-04-15 17:41:46,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {19399#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;~DevicePowerState~0 := 1;~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; {19399#true} is VALID [2022-04-15 17:41:46,838 INFO L272 TraceCheckUtils]: 6: Hoare triple {19399#true} call _BLAST_init(); {19438#(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-15 17:41:46,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {19438#(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; {19399#true} is VALID [2022-04-15 17:41:46,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,838 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {19399#true} {19399#true} #714#return; {19399#true} is VALID [2022-04-15 17:41:46,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {19399#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; {19399#true} is VALID [2022-04-15 17:41:46,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {19399#true} assume !(0 == ~irp_choice~0); {19399#true} is VALID [2022-04-15 17:41:46,838 INFO L272 TraceCheckUtils]: 12: Hoare triple {19399#true} call stub_driver_init(); {19439#(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-15 17:41:46,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {19439#(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; {19399#true} is VALID [2022-04-15 17:41:46,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,839 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19399#true} {19399#true} #716#return; {19399#true} is VALID [2022-04-15 17:41:46,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {19399#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {19399#true} is VALID [2022-04-15 17:41:46,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {19399#true} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {19399#true} is VALID [2022-04-15 17:41:46,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {19399#true} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {19399#true} is VALID [2022-04-15 17:41:46,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {19399#true} assume 3 == ~tmp_ndt_3~0; {19399#true} is VALID [2022-04-15 17:41:46,839 INFO L272 TraceCheckUtils]: 20: Hoare triple {19399#true} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {19399#true} is VALID [2022-04-15 17:41:46,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {19399#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; {19399#true} is VALID [2022-04-15 17:41:46,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {19399#true} assume 0 == ~irpStack__MinorFunction~0; {19399#true} is VALID [2022-04-15 17:41:46,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {19399#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {19399#true} is VALID [2022-04-15 17:41:46,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {19399#true} assume !(~s~0 != ~NP~0); {19399#true} is VALID [2022-04-15 17:41:46,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {19399#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {19399#true} is VALID [2022-04-15 17:41:46,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {19399#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {19399#true} is VALID [2022-04-15 17:41:46,840 INFO L272 TraceCheckUtils]: 27: Hoare triple {19399#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {19440#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:46,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {19440#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {19399#true} is VALID [2022-04-15 17:41:46,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {19399#true} assume 0 != ~compRegistered~0; {19399#true} is VALID [2022-04-15 17:41:46,842 INFO L272 TraceCheckUtils]: 30: Hoare triple {19399#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {19453#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:46,842 INFO L290 TraceCheckUtils]: 31: Hoare triple {19453#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {19399#true} is VALID [2022-04-15 17:41:46,842 INFO L272 TraceCheckUtils]: 32: Hoare triple {19399#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {19453#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:46,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {19453#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {19399#true} is VALID [2022-04-15 17:41:46,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,842 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {19399#true} {19399#true} #712#return; {19399#true} is VALID [2022-04-15 17:41:46,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {19399#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {19399#true} is VALID [2022-04-15 17:41:46,843 INFO L290 TraceCheckUtils]: 37: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,843 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {19399#true} {19399#true} #774#return; {19399#true} is VALID [2022-04-15 17:41:46,843 INFO L290 TraceCheckUtils]: 39: Hoare triple {19399#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {19399#true} is VALID [2022-04-15 17:41:46,843 INFO L290 TraceCheckUtils]: 40: Hoare triple {19399#true} assume -1073741802 == ~__cil_tmp7~0; {19399#true} is VALID [2022-04-15 17:41:46,843 INFO L272 TraceCheckUtils]: 41: Hoare triple {19399#true} call stubMoreProcessingRequired(); {19457#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:46,843 INFO L290 TraceCheckUtils]: 42: Hoare triple {19457#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {19399#true} is VALID [2022-04-15 17:41:46,843 INFO L290 TraceCheckUtils]: 43: Hoare triple {19399#true} assume true; {19399#true} is VALID [2022-04-15 17:41:46,843 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {19399#true} {19399#true} #776#return; {19399#true} is VALID [2022-04-15 17:41:46,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {19399#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {19399#true} is VALID [2022-04-15 17:41:46,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {19399#true} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {19399#true} is VALID [2022-04-15 17:41:46,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {19399#true} assume 1 == ~tmp_ndt_7~0; {19399#true} is VALID [2022-04-15 17:41:46,844 INFO L290 TraceCheckUtils]: 48: Hoare triple {19399#true} ~returnVal2~0 := -1073741823; {19452#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 17:41:46,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {19452#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume !(~s~0 == ~NP~0); {19452#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 17:41:46,845 INFO L290 TraceCheckUtils]: 50: Hoare triple {19452#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume ~s~0 == ~MPR1~0; {19452#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} is VALID [2022-04-15 17:41:46,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {19452#(<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {19400#false} is VALID [2022-04-15 17:41:46,845 INFO L290 TraceCheckUtils]: 52: Hoare triple {19400#false} #res := ~returnVal2~0; {19400#false} is VALID [2022-04-15 17:41:46,845 INFO L290 TraceCheckUtils]: 53: Hoare triple {19400#false} assume true; {19400#false} is VALID [2022-04-15 17:41:46,845 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19400#false} {19399#true} #752#return; {19400#false} is VALID [2022-04-15 17:41:46,845 INFO L290 TraceCheckUtils]: 55: Hoare triple {19400#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {19400#false} is VALID [2022-04-15 17:41:46,845 INFO L290 TraceCheckUtils]: 56: Hoare triple {19400#false} assume 259 == ~__cil_tmp23~0; {19400#false} is VALID [2022-04-15 17:41:46,845 INFO L272 TraceCheckUtils]: 57: Hoare triple {19400#false} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {19400#false} is VALID [2022-04-15 17:41:46,845 INFO L290 TraceCheckUtils]: 58: Hoare triple {19400#false} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {19400#false} is VALID [2022-04-15 17:41:46,845 INFO L290 TraceCheckUtils]: 59: Hoare triple {19400#false} assume !(~s~0 == ~MPR3~0); {19400#false} is VALID [2022-04-15 17:41:46,846 INFO L290 TraceCheckUtils]: 60: Hoare triple {19400#false} assume !(1 == ~customIrp~0); {19400#false} is VALID [2022-04-15 17:41:46,846 INFO L290 TraceCheckUtils]: 61: Hoare triple {19400#false} assume ~s~0 == ~MPR3~0; {19400#false} is VALID [2022-04-15 17:41:46,846 INFO L272 TraceCheckUtils]: 62: Hoare triple {19400#false} call errorFn(); {19400#false} is VALID [2022-04-15 17:41:46,846 INFO L290 TraceCheckUtils]: 63: Hoare triple {19400#false} assume !false; {19400#false} is VALID [2022-04-15 17:41:46,846 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-15 17:41:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:46,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717819891] [2022-04-15 17:41:46,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717819891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:46,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:46,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 17:41:46,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:46,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [346900803] [2022-04-15 17:41:46,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [346900803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:46,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:46,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 17:41:46,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39384962] [2022-04-15 17:41:46,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:46,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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 64 [2022-04-15 17:41:46,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:46,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-15 17:41:46,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:46,884 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 17:41:46,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:46,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 17:41:46,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-15 17:41:46,885 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-15 17:41:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:47,361 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2022-04-15 17:41:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 17:41:47,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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 64 [2022-04-15 17:41:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-15 17:41:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-04-15 17:41:47,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-15 17:41:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2022-04-15 17:41:47,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2022-04-15 17:41:47,453 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-15 17:41:47,454 INFO L225 Difference]: With dead ends: 126 [2022-04-15 17:41:47,454 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 17:41:47,454 INFO L912 BasicCegarLoop]: 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-15 17:41:47,455 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:47,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 207 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:41:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 17:41:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2022-04-15 17:41:47,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:47,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 95 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 72 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-15 17:41:47,601 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 95 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 72 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-15 17:41:47,601 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 95 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 72 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-15 17:41:47,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:47,602 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2022-04-15 17:41:47,602 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-04-15 17:41:47,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:47,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:47,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 72 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 98 states. [2022-04-15 17:41:47,603 INFO L87 Difference]: Start difference. First operand has 95 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 72 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 98 states. [2022-04-15 17:41:47,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:47,604 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2022-04-15 17:41:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-04-15 17:41:47,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:47,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:47,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:47,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.1408450704225352) internal successors, (81), 72 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-15 17:41:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-04-15 17:41:47,605 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 64 [2022-04-15 17:41:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:47,605 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-04-15 17:41:47,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-15 17:41:47,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 104 transitions. [2022-04-15 17:41:47,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-04-15 17:41:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 17:41:47,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:47,718 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:47,718 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 17:41:47,718 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:47,718 INFO L85 PathProgramCache]: Analyzing trace with hash -706274739, now seen corresponding path program 1 times [2022-04-15 17:41:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:47,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2101962472] [2022-04-15 17:41:47,719 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:47,719 INFO L85 PathProgramCache]: Analyzing trace with hash -706274739, now seen corresponding path program 2 times [2022-04-15 17:41:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:47,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751226737] [2022-04-15 17:41:47,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:47,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:47,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:47,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {20137#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {20098#true} is VALID [2022-04-15 17:41:47,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20098#true} {20098#true} #780#return; {20098#true} is VALID [2022-04-15 17:41:47,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:47,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {20138#(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; {20098#true} is VALID [2022-04-15 17:41:47,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20098#true} {20098#true} #714#return; {20098#true} is VALID [2022-04-15 17:41:47,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:47,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {20139#(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; {20098#true} is VALID [2022-04-15 17:41:47,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20098#true} {20098#true} #716#return; {20098#true} is VALID [2022-04-15 17:41:47,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 17:41:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:47,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 17:41:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:47,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 17:41:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:47,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {20152#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {20098#true} is VALID [2022-04-15 17:41:47,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20098#true} {20098#true} #712#return; {20098#true} is VALID [2022-04-15 17:41:47,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {20152#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {20098#true} is VALID [2022-04-15 17:41:47,825 INFO L272 TraceCheckUtils]: 1: Hoare triple {20098#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {20152#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:47,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {20152#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {20098#true} is VALID [2022-04-15 17:41:47,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,825 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20098#true} {20098#true} #712#return; {20098#true} is VALID [2022-04-15 17:41:47,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {20098#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {20098#true} is VALID [2022-04-15 17:41:47,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,825 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20098#true} {20098#true} #774#return; {20098#true} is VALID [2022-04-15 17:41:47,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 17:41:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:47,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {20156#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {20098#true} is VALID [2022-04-15 17:41:47,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,832 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20098#true} {20098#true} #776#return; {20098#true} is VALID [2022-04-15 17:41:47,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {20140#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {20098#true} is VALID [2022-04-15 17:41:47,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {20098#true} assume 0 != ~compRegistered~0; {20098#true} is VALID [2022-04-15 17:41:47,833 INFO L272 TraceCheckUtils]: 2: Hoare triple {20098#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {20152#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:47,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {20152#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {20098#true} is VALID [2022-04-15 17:41:47,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {20098#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {20152#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:47,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {20152#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {20098#true} is VALID [2022-04-15 17:41:47,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,833 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20098#true} {20098#true} #712#return; {20098#true} is VALID [2022-04-15 17:41:47,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {20098#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {20098#true} is VALID [2022-04-15 17:41:47,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,834 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20098#true} {20098#true} #774#return; {20098#true} is VALID [2022-04-15 17:41:47,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {20098#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {20098#true} is VALID [2022-04-15 17:41:47,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {20098#true} assume -1073741802 == ~__cil_tmp7~0; {20098#true} is VALID [2022-04-15 17:41:47,834 INFO L272 TraceCheckUtils]: 13: Hoare triple {20098#true} call stubMoreProcessingRequired(); {20156#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:47,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {20156#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {20098#true} is VALID [2022-04-15 17:41:47,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,834 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20098#true} {20098#true} #776#return; {20098#true} is VALID [2022-04-15 17:41:47,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {20098#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {20098#true} is VALID [2022-04-15 17:41:47,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {20098#true} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {20098#true} is VALID [2022-04-15 17:41:47,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {20098#true} assume 1 == ~tmp_ndt_7~0; {20098#true} is VALID [2022-04-15 17:41:47,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {20098#true} ~returnVal2~0 := -1073741823; {20098#true} is VALID [2022-04-15 17:41:47,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {20098#true} assume !(~s~0 == ~NP~0); {20098#true} is VALID [2022-04-15 17:41:47,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {20098#true} assume ~s~0 == ~MPR1~0; {20098#true} is VALID [2022-04-15 17:41:47,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {20098#true} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {20098#true} is VALID [2022-04-15 17:41:47,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {20098#true} #res := ~returnVal2~0; {20098#true} is VALID [2022-04-15 17:41:47,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,835 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20098#true} {20098#true} #752#return; {20098#true} is VALID [2022-04-15 17:41:47,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {20098#true} call ULTIMATE.init(); {20137#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:47,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {20137#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {20098#true} is VALID [2022-04-15 17:41:47,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20098#true} {20098#true} #780#return; {20098#true} is VALID [2022-04-15 17:41:47,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {20098#true} call #t~ret83 := main(); {20098#true} is VALID [2022-04-15 17:41:47,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {20098#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;~DevicePowerState~0 := 1;~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; {20098#true} is VALID [2022-04-15 17:41:47,837 INFO L272 TraceCheckUtils]: 6: Hoare triple {20098#true} call _BLAST_init(); {20138#(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-15 17:41:47,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {20138#(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; {20098#true} is VALID [2022-04-15 17:41:47,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,838 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {20098#true} {20098#true} #714#return; {20098#true} is VALID [2022-04-15 17:41:47,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {20098#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; {20098#true} is VALID [2022-04-15 17:41:47,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {20098#true} assume !(0 == ~irp_choice~0); {20098#true} is VALID [2022-04-15 17:41:47,838 INFO L272 TraceCheckUtils]: 12: Hoare triple {20098#true} call stub_driver_init(); {20139#(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-15 17:41:47,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {20139#(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; {20098#true} is VALID [2022-04-15 17:41:47,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,838 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20098#true} {20098#true} #716#return; {20098#true} is VALID [2022-04-15 17:41:47,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {20098#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {20098#true} is VALID [2022-04-15 17:41:47,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {20098#true} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {20098#true} is VALID [2022-04-15 17:41:47,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {20098#true} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {20098#true} is VALID [2022-04-15 17:41:47,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {20098#true} assume 3 == ~tmp_ndt_3~0; {20098#true} is VALID [2022-04-15 17:41:47,839 INFO L272 TraceCheckUtils]: 20: Hoare triple {20098#true} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {20098#true} is VALID [2022-04-15 17:41:47,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {20098#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; {20098#true} is VALID [2022-04-15 17:41:47,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {20098#true} assume 0 == ~irpStack__MinorFunction~0; {20098#true} is VALID [2022-04-15 17:41:47,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {20098#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {20098#true} is VALID [2022-04-15 17:41:47,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {20098#true} assume !(~s~0 != ~NP~0); {20098#true} is VALID [2022-04-15 17:41:47,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {20098#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {20098#true} is VALID [2022-04-15 17:41:47,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {20098#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {20098#true} is VALID [2022-04-15 17:41:47,840 INFO L272 TraceCheckUtils]: 27: Hoare triple {20098#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {20140#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:47,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {20140#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {20098#true} is VALID [2022-04-15 17:41:47,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {20098#true} assume 0 != ~compRegistered~0; {20098#true} is VALID [2022-04-15 17:41:47,840 INFO L272 TraceCheckUtils]: 30: Hoare triple {20098#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {20152#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:47,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {20152#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {20098#true} is VALID [2022-04-15 17:41:47,841 INFO L272 TraceCheckUtils]: 32: Hoare triple {20098#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {20152#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:47,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {20152#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {20098#true} is VALID [2022-04-15 17:41:47,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,841 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20098#true} {20098#true} #712#return; {20098#true} is VALID [2022-04-15 17:41:47,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {20098#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {20098#true} is VALID [2022-04-15 17:41:47,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,841 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20098#true} {20098#true} #774#return; {20098#true} is VALID [2022-04-15 17:41:47,841 INFO L290 TraceCheckUtils]: 39: Hoare triple {20098#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {20098#true} is VALID [2022-04-15 17:41:47,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {20098#true} assume -1073741802 == ~__cil_tmp7~0; {20098#true} is VALID [2022-04-15 17:41:47,842 INFO L272 TraceCheckUtils]: 41: Hoare triple {20098#true} call stubMoreProcessingRequired(); {20156#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:47,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {20156#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {20098#true} is VALID [2022-04-15 17:41:47,842 INFO L290 TraceCheckUtils]: 43: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,842 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {20098#true} {20098#true} #776#return; {20098#true} is VALID [2022-04-15 17:41:47,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {20098#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {20098#true} is VALID [2022-04-15 17:41:47,842 INFO L290 TraceCheckUtils]: 46: Hoare triple {20098#true} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {20098#true} is VALID [2022-04-15 17:41:47,842 INFO L290 TraceCheckUtils]: 47: Hoare triple {20098#true} assume 1 == ~tmp_ndt_7~0; {20098#true} is VALID [2022-04-15 17:41:47,842 INFO L290 TraceCheckUtils]: 48: Hoare triple {20098#true} ~returnVal2~0 := -1073741823; {20098#true} is VALID [2022-04-15 17:41:47,842 INFO L290 TraceCheckUtils]: 49: Hoare triple {20098#true} assume !(~s~0 == ~NP~0); {20098#true} is VALID [2022-04-15 17:41:47,842 INFO L290 TraceCheckUtils]: 50: Hoare triple {20098#true} assume ~s~0 == ~MPR1~0; {20098#true} is VALID [2022-04-15 17:41:47,842 INFO L290 TraceCheckUtils]: 51: Hoare triple {20098#true} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {20098#true} is VALID [2022-04-15 17:41:47,843 INFO L290 TraceCheckUtils]: 52: Hoare triple {20098#true} #res := ~returnVal2~0; {20098#true} is VALID [2022-04-15 17:41:47,843 INFO L290 TraceCheckUtils]: 53: Hoare triple {20098#true} assume true; {20098#true} is VALID [2022-04-15 17:41:47,843 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {20098#true} {20098#true} #752#return; {20098#true} is VALID [2022-04-15 17:41:47,843 INFO L290 TraceCheckUtils]: 55: Hoare triple {20098#true} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {20098#true} is VALID [2022-04-15 17:41:47,843 INFO L290 TraceCheckUtils]: 56: Hoare triple {20098#true} assume 259 == ~__cil_tmp23~0; {20098#true} is VALID [2022-04-15 17:41:47,843 INFO L272 TraceCheckUtils]: 57: Hoare triple {20098#true} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {20098#true} is VALID [2022-04-15 17:41:47,843 INFO L290 TraceCheckUtils]: 58: Hoare triple {20098#true} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {20098#true} is VALID [2022-04-15 17:41:47,843 INFO L290 TraceCheckUtils]: 59: Hoare triple {20098#true} assume !(~s~0 == ~MPR3~0); {20136#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 17:41:47,843 INFO L290 TraceCheckUtils]: 60: Hoare triple {20136#(not (= ~MPR3~0 ~s~0))} assume !(1 == ~customIrp~0); {20136#(not (= ~MPR3~0 ~s~0))} is VALID [2022-04-15 17:41:47,844 INFO L290 TraceCheckUtils]: 61: Hoare triple {20136#(not (= ~MPR3~0 ~s~0))} assume ~s~0 == ~MPR3~0; {20099#false} is VALID [2022-04-15 17:41:47,844 INFO L272 TraceCheckUtils]: 62: Hoare triple {20099#false} call errorFn(); {20099#false} is VALID [2022-04-15 17:41:47,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {20099#false} assume !false; {20099#false} is VALID [2022-04-15 17:41:47,844 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-15 17:41:47,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:47,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751226737] [2022-04-15 17:41:47,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751226737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:47,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:47,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 17:41:47,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:47,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2101962472] [2022-04-15 17:41:47,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2101962472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:47,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:47,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 17:41:47,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735694724] [2022-04-15 17:41:47,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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 64 [2022-04-15 17:41:47,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:47,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-15 17:41:47,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:47,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 17:41:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:47,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 17:41:47,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-15 17:41:47,882 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-15 17:41:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:48,485 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-04-15 17:41:48,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 17:41:48,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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 64 [2022-04-15 17:41:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-15 17:41:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-04-15 17:41:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-15 17:41:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-04-15 17:41:48,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 104 transitions. [2022-04-15 17:41:48,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:48,571 INFO L225 Difference]: With dead ends: 111 [2022-04-15 17:41:48,571 INFO L226 Difference]: Without dead ends: 106 [2022-04-15 17:41:48,572 INFO L912 BasicCegarLoop]: 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-15 17:41:48,573 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 77 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:48,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 239 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:41:48,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-15 17:41:48,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 97. [2022-04-15 17:41:48,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:48,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 97 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 74 states have internal predecessors, (82), 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-15 17:41:48,708 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 97 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 74 states have internal predecessors, (82), 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-15 17:41:48,708 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 97 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 74 states have internal predecessors, (82), 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-15 17:41:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:48,709 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-04-15 17:41:48,709 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2022-04-15 17:41:48,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:48,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:48,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 74 states have internal predecessors, (82), 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 106 states. [2022-04-15 17:41:48,710 INFO L87 Difference]: Start difference. First operand has 97 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 74 states have internal predecessors, (82), 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 106 states. [2022-04-15 17:41:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:48,711 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-04-15 17:41:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2022-04-15 17:41:48,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:48,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:48,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:48,711 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 74 states have internal predecessors, (82), 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-15 17:41:48,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-04-15 17:41:48,712 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 64 [2022-04-15 17:41:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:48,712 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-04-15 17:41:48,713 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 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-15 17:41:48,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 105 transitions. [2022-04-15 17:41:48,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-04-15 17:41:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 17:41:48,824 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:48,824 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:48,824 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 17:41:48,824 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:48,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:48,825 INFO L85 PathProgramCache]: Analyzing trace with hash -348732964, now seen corresponding path program 1 times [2022-04-15 17:41:48,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:48,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [161168401] [2022-04-15 17:41:48,825 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:48,825 INFO L85 PathProgramCache]: Analyzing trace with hash -348732964, now seen corresponding path program 2 times [2022-04-15 17:41:48,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:48,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663474282] [2022-04-15 17:41:48,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:48,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:48,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {20829#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {20789#true} is VALID [2022-04-15 17:41:48,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20789#true} {20789#true} #780#return; {20789#true} is VALID [2022-04-15 17:41:48,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:48,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {20830#(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; {20789#true} is VALID [2022-04-15 17:41:48,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20789#true} {20789#true} #714#return; {20789#true} is VALID [2022-04-15 17:41:48,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:48,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {20831#(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; {20789#true} is VALID [2022-04-15 17:41:48,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20789#true} {20789#true} #716#return; {20789#true} is VALID [2022-04-15 17:41:48,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 17:41:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 17:41:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:48,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 17:41:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:48,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {20846#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {20789#true} is VALID [2022-04-15 17:41:48,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20789#true} {20789#true} #712#return; {20789#true} is VALID [2022-04-15 17:41:48,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {20846#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {20789#true} is VALID [2022-04-15 17:41:48,960 INFO L272 TraceCheckUtils]: 1: Hoare triple {20789#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {20846#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:48,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {20846#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {20789#true} is VALID [2022-04-15 17:41:48,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,961 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20789#true} {20789#true} #712#return; {20789#true} is VALID [2022-04-15 17:41:48,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {20789#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {20789#true} is VALID [2022-04-15 17:41:48,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,961 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20789#true} {20789#true} #774#return; {20789#true} is VALID [2022-04-15 17:41:48,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 17:41:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:48,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {20850#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {20789#true} is VALID [2022-04-15 17:41:48,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20789#true} {20789#true} #776#return; {20789#true} is VALID [2022-04-15 17:41:48,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {20832#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {20789#true} is VALID [2022-04-15 17:41:48,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {20789#true} assume 0 != ~compRegistered~0; {20789#true} is VALID [2022-04-15 17:41:48,970 INFO L272 TraceCheckUtils]: 2: Hoare triple {20789#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {20846#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:48,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {20846#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {20789#true} is VALID [2022-04-15 17:41:48,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {20789#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {20846#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:48,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {20846#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {20789#true} is VALID [2022-04-15 17:41:48,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,971 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20789#true} {20789#true} #712#return; {20789#true} is VALID [2022-04-15 17:41:48,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {20789#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {20789#true} is VALID [2022-04-15 17:41:48,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,971 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20789#true} {20789#true} #774#return; {20789#true} is VALID [2022-04-15 17:41:48,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {20789#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {20789#true} is VALID [2022-04-15 17:41:48,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {20789#true} assume -1073741802 == ~__cil_tmp7~0; {20789#true} is VALID [2022-04-15 17:41:48,971 INFO L272 TraceCheckUtils]: 13: Hoare triple {20789#true} call stubMoreProcessingRequired(); {20850#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:48,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {20850#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {20789#true} is VALID [2022-04-15 17:41:48,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,972 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {20789#true} {20789#true} #776#return; {20789#true} is VALID [2022-04-15 17:41:48,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {20789#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {20789#true} is VALID [2022-04-15 17:41:48,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {20789#true} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {20789#true} is VALID [2022-04-15 17:41:48,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {20789#true} assume !(1 == ~tmp_ndt_7~0); {20789#true} is VALID [2022-04-15 17:41:48,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {20789#true} ~returnVal2~0 := 259; {20844#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 17:41:48,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {20844#(<= 259 IofCallDriver_~returnVal2~0)} assume !(~s~0 == ~NP~0); {20844#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 17:41:48,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {20844#(<= 259 IofCallDriver_~returnVal2~0)} assume ~s~0 == ~MPR1~0; {20844#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 17:41:48,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {20844#(<= 259 IofCallDriver_~returnVal2~0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {20844#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 17:41:48,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {20844#(<= 259 IofCallDriver_~returnVal2~0)} #res := ~returnVal2~0; {20845#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-15 17:41:48,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {20845#(<= 259 |IofCallDriver_#res|)} assume true; {20845#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-15 17:41:48,974 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {20845#(<= 259 |IofCallDriver_#res|)} {20789#true} #752#return; {20827#(<= 259 |KbFilter_PnP_#t~ret12|)} is VALID [2022-04-15 17:41:48,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {20789#true} call ULTIMATE.init(); {20829#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:48,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {20829#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {20789#true} is VALID [2022-04-15 17:41:48,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20789#true} {20789#true} #780#return; {20789#true} is VALID [2022-04-15 17:41:48,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {20789#true} call #t~ret83 := main(); {20789#true} is VALID [2022-04-15 17:41:48,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {20789#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;~DevicePowerState~0 := 1;~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; {20789#true} is VALID [2022-04-15 17:41:48,976 INFO L272 TraceCheckUtils]: 6: Hoare triple {20789#true} call _BLAST_init(); {20830#(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-15 17:41:48,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {20830#(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; {20789#true} is VALID [2022-04-15 17:41:48,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,976 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {20789#true} {20789#true} #714#return; {20789#true} is VALID [2022-04-15 17:41:48,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {20789#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; {20789#true} is VALID [2022-04-15 17:41:48,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {20789#true} assume !(0 == ~irp_choice~0); {20789#true} is VALID [2022-04-15 17:41:48,977 INFO L272 TraceCheckUtils]: 12: Hoare triple {20789#true} call stub_driver_init(); {20831#(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-15 17:41:48,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {20831#(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; {20789#true} is VALID [2022-04-15 17:41:48,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,977 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20789#true} {20789#true} #716#return; {20789#true} is VALID [2022-04-15 17:41:48,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {20789#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {20789#true} is VALID [2022-04-15 17:41:48,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {20789#true} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {20789#true} is VALID [2022-04-15 17:41:48,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {20789#true} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {20789#true} is VALID [2022-04-15 17:41:48,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {20789#true} assume 3 == ~tmp_ndt_3~0; {20789#true} is VALID [2022-04-15 17:41:48,977 INFO L272 TraceCheckUtils]: 20: Hoare triple {20789#true} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {20789#true} is VALID [2022-04-15 17:41:48,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {20789#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; {20789#true} is VALID [2022-04-15 17:41:48,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {20789#true} assume 0 == ~irpStack__MinorFunction~0; {20789#true} is VALID [2022-04-15 17:41:48,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {20789#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {20789#true} is VALID [2022-04-15 17:41:48,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {20789#true} assume !(~s~0 != ~NP~0); {20789#true} is VALID [2022-04-15 17:41:48,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {20789#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {20789#true} is VALID [2022-04-15 17:41:48,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {20789#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {20789#true} is VALID [2022-04-15 17:41:48,978 INFO L272 TraceCheckUtils]: 27: Hoare triple {20789#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {20832#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:48,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {20832#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {20789#true} is VALID [2022-04-15 17:41:48,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {20789#true} assume 0 != ~compRegistered~0; {20789#true} is VALID [2022-04-15 17:41:48,979 INFO L272 TraceCheckUtils]: 30: Hoare triple {20789#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {20846#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:48,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {20846#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {20789#true} is VALID [2022-04-15 17:41:48,979 INFO L272 TraceCheckUtils]: 32: Hoare triple {20789#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {20846#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:48,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {20846#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {20789#true} is VALID [2022-04-15 17:41:48,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,980 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20789#true} {20789#true} #712#return; {20789#true} is VALID [2022-04-15 17:41:48,980 INFO L290 TraceCheckUtils]: 36: Hoare triple {20789#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {20789#true} is VALID [2022-04-15 17:41:48,980 INFO L290 TraceCheckUtils]: 37: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,980 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {20789#true} {20789#true} #774#return; {20789#true} is VALID [2022-04-15 17:41:48,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {20789#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {20789#true} is VALID [2022-04-15 17:41:48,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {20789#true} assume -1073741802 == ~__cil_tmp7~0; {20789#true} is VALID [2022-04-15 17:41:48,980 INFO L272 TraceCheckUtils]: 41: Hoare triple {20789#true} call stubMoreProcessingRequired(); {20850#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:48,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {20850#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {20789#true} is VALID [2022-04-15 17:41:48,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {20789#true} assume true; {20789#true} is VALID [2022-04-15 17:41:48,981 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {20789#true} {20789#true} #776#return; {20789#true} is VALID [2022-04-15 17:41:48,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {20789#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {20789#true} is VALID [2022-04-15 17:41:48,981 INFO L290 TraceCheckUtils]: 46: Hoare triple {20789#true} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {20789#true} is VALID [2022-04-15 17:41:48,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {20789#true} assume !(1 == ~tmp_ndt_7~0); {20789#true} is VALID [2022-04-15 17:41:48,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {20789#true} ~returnVal2~0 := 259; {20844#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 17:41:48,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {20844#(<= 259 IofCallDriver_~returnVal2~0)} assume !(~s~0 == ~NP~0); {20844#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 17:41:48,981 INFO L290 TraceCheckUtils]: 50: Hoare triple {20844#(<= 259 IofCallDriver_~returnVal2~0)} assume ~s~0 == ~MPR1~0; {20844#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 17:41:48,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {20844#(<= 259 IofCallDriver_~returnVal2~0)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {20844#(<= 259 IofCallDriver_~returnVal2~0)} is VALID [2022-04-15 17:41:48,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {20844#(<= 259 IofCallDriver_~returnVal2~0)} #res := ~returnVal2~0; {20845#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-15 17:41:48,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {20845#(<= 259 |IofCallDriver_#res|)} assume true; {20845#(<= 259 |IofCallDriver_#res|)} is VALID [2022-04-15 17:41:48,983 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {20845#(<= 259 |IofCallDriver_#res|)} {20789#true} #752#return; {20827#(<= 259 |KbFilter_PnP_#t~ret12|)} is VALID [2022-04-15 17:41:48,983 INFO L290 TraceCheckUtils]: 55: Hoare triple {20827#(<= 259 |KbFilter_PnP_#t~ret12|)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {20828#(<= 259 KbFilter_PnP_~status~0)} is VALID [2022-04-15 17:41:48,983 INFO L290 TraceCheckUtils]: 56: Hoare triple {20828#(<= 259 KbFilter_PnP_~status~0)} assume !(259 == ~__cil_tmp23~0); {20828#(<= 259 KbFilter_PnP_~status~0)} is VALID [2022-04-15 17:41:48,983 INFO L290 TraceCheckUtils]: 57: Hoare triple {20828#(<= 259 KbFilter_PnP_~status~0)} assume !(~status~0 >= 0); {20790#false} is VALID [2022-04-15 17:41:48,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {20790#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {20790#false} is VALID [2022-04-15 17:41:48,984 INFO L272 TraceCheckUtils]: 59: Hoare triple {20790#false} call IofCompleteRequest(~Irp, 0); {20790#false} is VALID [2022-04-15 17:41:48,984 INFO L290 TraceCheckUtils]: 60: Hoare triple {20790#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {20790#false} is VALID [2022-04-15 17:41:48,984 INFO L290 TraceCheckUtils]: 61: Hoare triple {20790#false} assume !(~s~0 == ~NP~0); {20790#false} is VALID [2022-04-15 17:41:48,984 INFO L272 TraceCheckUtils]: 62: Hoare triple {20790#false} call errorFn(); {20790#false} is VALID [2022-04-15 17:41:48,984 INFO L290 TraceCheckUtils]: 63: Hoare triple {20790#false} assume !false; {20790#false} is VALID [2022-04-15 17:41:48,984 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-15 17:41:48,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:48,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663474282] [2022-04-15 17:41:48,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663474282] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:48,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:48,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:41:48,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:48,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [161168401] [2022-04-15 17:41:48,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [161168401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:48,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:48,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:41:48,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152279992] [2022-04-15 17:41:48,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:48,985 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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 64 [2022-04-15 17:41:48,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:48,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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-15 17:41:49,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:49,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 17:41:49,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:49,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 17:41:49,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:41:49,024 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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-15 17:41:49,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:49,864 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-04-15 17:41:49,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 17:41:49,864 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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 64 [2022-04-15 17:41:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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-15 17:41:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2022-04-15 17:41:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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-15 17:41:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2022-04-15 17:41:49,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 104 transitions. [2022-04-15 17:41:49,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:49,946 INFO L225 Difference]: With dead ends: 110 [2022-04-15 17:41:49,946 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 17:41:49,947 INFO L912 BasicCegarLoop]: 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-15 17:41:49,947 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 42 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:49,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 324 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 17:41:49,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 17:41:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2022-04-15 17:41:50,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:50,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 97 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 74 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-15 17:41:50,117 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 97 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 74 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-15 17:41:50,117 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 97 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 74 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-15 17:41:50,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:50,119 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-04-15 17:41:50,119 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-04-15 17:41:50,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:50,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:50,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 74 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 103 states. [2022-04-15 17:41:50,119 INFO L87 Difference]: Start difference. First operand has 97 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 74 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 103 states. [2022-04-15 17:41:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:50,120 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-04-15 17:41:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-04-15 17:41:50,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:50,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:50,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:50,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 74 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-15 17:41:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-04-15 17:41:50,122 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 64 [2022-04-15 17:41:50,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:50,122 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-04-15 17:41:50,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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-15 17:41:50,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 104 transitions. [2022-04-15 17:41:50,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:50,234 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-04-15 17:41:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 17:41:50,234 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:50,234 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:50,234 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 17:41:50,235 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:50,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash -657469950, now seen corresponding path program 1 times [2022-04-15 17:41:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:50,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1934769604] [2022-04-15 17:41:50,235 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:50,235 INFO L85 PathProgramCache]: Analyzing trace with hash -657469950, now seen corresponding path program 2 times [2022-04-15 17:41:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:50,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299788022] [2022-04-15 17:41:50,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:50,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:50,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:50,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {21515#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {21475#true} is VALID [2022-04-15 17:41:50,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21475#true} {21475#true} #780#return; {21475#true} is VALID [2022-04-15 17:41:50,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:50,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {21516#(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; {21517#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} is VALID [2022-04-15 17:41:50,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {21517#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} assume true; {21517#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} is VALID [2022-04-15 17:41:50,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21517#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} {21475#true} #714#return; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:50,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {21518#(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; {21475#true} is VALID [2022-04-15 17:41:50,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,391 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21475#true} {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #716#return; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 17:41:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:50,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 17:41:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:50,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 17:41:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:50,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {21532#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {21475#true} is VALID [2022-04-15 17:41:50,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21475#true} {21475#true} #712#return; {21475#true} is VALID [2022-04-15 17:41:50,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {21532#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {21475#true} is VALID [2022-04-15 17:41:50,426 INFO L272 TraceCheckUtils]: 1: Hoare triple {21475#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {21532#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:50,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {21532#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {21475#true} is VALID [2022-04-15 17:41:50,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,426 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {21475#true} {21475#true} #712#return; {21475#true} is VALID [2022-04-15 17:41:50,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {21475#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {21475#true} is VALID [2022-04-15 17:41:50,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,427 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21475#true} {21475#true} #774#return; {21475#true} is VALID [2022-04-15 17:41:50,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 17:41:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:50,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {21536#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {21475#true} is VALID [2022-04-15 17:41:50,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21475#true} {21475#true} #776#return; {21475#true} is VALID [2022-04-15 17:41:50,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {21519#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {21475#true} is VALID [2022-04-15 17:41:50,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {21475#true} assume 0 != ~compRegistered~0; {21475#true} is VALID [2022-04-15 17:41:50,434 INFO L272 TraceCheckUtils]: 2: Hoare triple {21475#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {21532#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:50,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {21532#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {21475#true} is VALID [2022-04-15 17:41:50,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {21475#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {21532#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:50,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {21532#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {21475#true} is VALID [2022-04-15 17:41:50,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,435 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {21475#true} {21475#true} #712#return; {21475#true} is VALID [2022-04-15 17:41:50,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {21475#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {21475#true} is VALID [2022-04-15 17:41:50,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21475#true} {21475#true} #774#return; {21475#true} is VALID [2022-04-15 17:41:50,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {21475#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {21475#true} is VALID [2022-04-15 17:41:50,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {21475#true} assume -1073741802 == ~__cil_tmp7~0; {21475#true} is VALID [2022-04-15 17:41:50,436 INFO L272 TraceCheckUtils]: 13: Hoare triple {21475#true} call stubMoreProcessingRequired(); {21536#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:50,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {21536#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {21475#true} is VALID [2022-04-15 17:41:50,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,436 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {21475#true} {21475#true} #776#return; {21475#true} is VALID [2022-04-15 17:41:50,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {21475#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {21475#true} is VALID [2022-04-15 17:41:50,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {21475#true} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {21475#true} is VALID [2022-04-15 17:41:50,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {21475#true} assume 1 == ~tmp_ndt_7~0; {21475#true} is VALID [2022-04-15 17:41:50,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {21475#true} ~returnVal2~0 := -1073741823; {21475#true} is VALID [2022-04-15 17:41:50,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {21475#true} assume !(~s~0 == ~NP~0); {21475#true} is VALID [2022-04-15 17:41:50,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {21475#true} assume ~s~0 == ~MPR1~0; {21475#true} is VALID [2022-04-15 17:41:50,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {21475#true} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {21531#(or (= ~s~0 1) (= ~s~0 ~NP~0))} is VALID [2022-04-15 17:41:50,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {21531#(or (= ~s~0 1) (= ~s~0 ~NP~0))} #res := ~returnVal2~0; {21531#(or (= ~s~0 1) (= ~s~0 ~NP~0))} is VALID [2022-04-15 17:41:50,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {21531#(or (= ~s~0 1) (= ~s~0 ~NP~0))} assume true; {21531#(or (= ~s~0 1) (= ~s~0 ~NP~0))} is VALID [2022-04-15 17:41:50,438 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {21531#(or (= ~s~0 1) (= ~s~0 ~NP~0))} {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #752#return; {21514#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {21475#true} call ULTIMATE.init(); {21515#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:50,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {21515#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {21475#true} is VALID [2022-04-15 17:41:50,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21475#true} {21475#true} #780#return; {21475#true} is VALID [2022-04-15 17:41:50,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {21475#true} call #t~ret83 := main(); {21475#true} is VALID [2022-04-15 17:41:50,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {21475#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;~DevicePowerState~0 := 1;~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; {21475#true} is VALID [2022-04-15 17:41:50,440 INFO L272 TraceCheckUtils]: 6: Hoare triple {21475#true} call _BLAST_init(); {21516#(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-15 17:41:50,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {21516#(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; {21517#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} is VALID [2022-04-15 17:41:50,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {21517#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} assume true; {21517#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} is VALID [2022-04-15 17:41:50,441 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {21517#(and (<= 6 ~MPR3~0) (= (+ (- 1) ~NP~0) 0))} {21475#true} #714#return; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~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; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume !(0 == ~irp_choice~0); {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,442 INFO L272 TraceCheckUtils]: 12: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} call stub_driver_init(); {21518#(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-15 17:41:50,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {21518#(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; {21475#true} is VALID [2022-04-15 17:41:50,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,443 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21475#true} {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #716#return; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume 3 == ~tmp_ndt_3~0; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,444 INFO L272 TraceCheckUtils]: 20: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~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; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume 0 == ~irpStack__MinorFunction~0; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,446 INFO L290 TraceCheckUtils]: 23: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume !(~s~0 != ~NP~0); {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,447 INFO L272 TraceCheckUtils]: 27: Hoare triple {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {21519#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:50,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {21519#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {21475#true} is VALID [2022-04-15 17:41:50,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {21475#true} assume 0 != ~compRegistered~0; {21475#true} is VALID [2022-04-15 17:41:50,448 INFO L272 TraceCheckUtils]: 30: Hoare triple {21475#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {21532#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:50,448 INFO L290 TraceCheckUtils]: 31: Hoare triple {21532#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {21475#true} is VALID [2022-04-15 17:41:50,448 INFO L272 TraceCheckUtils]: 32: Hoare triple {21475#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {21532#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:50,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {21532#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {21475#true} is VALID [2022-04-15 17:41:50,448 INFO L290 TraceCheckUtils]: 34: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,448 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {21475#true} {21475#true} #712#return; {21475#true} is VALID [2022-04-15 17:41:50,448 INFO L290 TraceCheckUtils]: 36: Hoare triple {21475#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {21475#true} is VALID [2022-04-15 17:41:50,449 INFO L290 TraceCheckUtils]: 37: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,449 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {21475#true} {21475#true} #774#return; {21475#true} is VALID [2022-04-15 17:41:50,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {21475#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {21475#true} is VALID [2022-04-15 17:41:50,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {21475#true} assume -1073741802 == ~__cil_tmp7~0; {21475#true} is VALID [2022-04-15 17:41:50,449 INFO L272 TraceCheckUtils]: 41: Hoare triple {21475#true} call stubMoreProcessingRequired(); {21536#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:50,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {21536#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {21475#true} is VALID [2022-04-15 17:41:50,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {21475#true} assume true; {21475#true} is VALID [2022-04-15 17:41:50,449 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {21475#true} {21475#true} #776#return; {21475#true} is VALID [2022-04-15 17:41:50,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {21475#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {21475#true} is VALID [2022-04-15 17:41:50,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {21475#true} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {21475#true} is VALID [2022-04-15 17:41:50,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {21475#true} assume 1 == ~tmp_ndt_7~0; {21475#true} is VALID [2022-04-15 17:41:50,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {21475#true} ~returnVal2~0 := -1073741823; {21475#true} is VALID [2022-04-15 17:41:50,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {21475#true} assume !(~s~0 == ~NP~0); {21475#true} is VALID [2022-04-15 17:41:50,450 INFO L290 TraceCheckUtils]: 50: Hoare triple {21475#true} assume ~s~0 == ~MPR1~0; {21475#true} is VALID [2022-04-15 17:41:50,450 INFO L290 TraceCheckUtils]: 51: Hoare triple {21475#true} assume !(259 == ~returnVal2~0);~s~0 := ~NP~0;~lowerDriverReturn~0 := ~returnVal2~0; {21531#(or (= ~s~0 1) (= ~s~0 ~NP~0))} is VALID [2022-04-15 17:41:50,450 INFO L290 TraceCheckUtils]: 52: Hoare triple {21531#(or (= ~s~0 1) (= ~s~0 ~NP~0))} #res := ~returnVal2~0; {21531#(or (= ~s~0 1) (= ~s~0 ~NP~0))} is VALID [2022-04-15 17:41:50,450 INFO L290 TraceCheckUtils]: 53: Hoare triple {21531#(or (= ~s~0 1) (= ~s~0 ~NP~0))} assume true; {21531#(or (= ~s~0 1) (= ~s~0 ~NP~0))} is VALID [2022-04-15 17:41:50,451 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21531#(or (= ~s~0 1) (= ~s~0 ~NP~0))} {21483#(and (= ~NP~0 1) (not (= ~MPR3~0 1)))} #752#return; {21514#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,451 INFO L290 TraceCheckUtils]: 55: Hoare triple {21514#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {21514#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {21514#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} assume 259 == ~__cil_tmp23~0; {21514#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,452 INFO L272 TraceCheckUtils]: 57: Hoare triple {21514#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {21514#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,452 INFO L290 TraceCheckUtils]: 58: Hoare triple {21514#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {21514#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} is VALID [2022-04-15 17:41:50,453 INFO L290 TraceCheckUtils]: 59: Hoare triple {21514#(and (= ~s~0 1) (not (= ~MPR3~0 1)))} assume ~s~0 == ~MPR3~0; {21476#false} is VALID [2022-04-15 17:41:50,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {21476#false} assume !(1 == ~setEventCalled~0); {21476#false} is VALID [2022-04-15 17:41:50,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {21476#false} assume !(1 == ~customIrp~0); {21476#false} is VALID [2022-04-15 17:41:50,453 INFO L290 TraceCheckUtils]: 62: Hoare triple {21476#false} assume ~s~0 == ~MPR3~0; {21476#false} is VALID [2022-04-15 17:41:50,453 INFO L272 TraceCheckUtils]: 63: Hoare triple {21476#false} call errorFn(); {21476#false} is VALID [2022-04-15 17:41:50,453 INFO L290 TraceCheckUtils]: 64: Hoare triple {21476#false} assume !false; {21476#false} is VALID [2022-04-15 17:41:50,453 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-15 17:41:50,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:50,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299788022] [2022-04-15 17:41:50,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299788022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:50,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:50,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:41:50,454 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:50,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1934769604] [2022-04-15 17:41:50,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1934769604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:50,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:50,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:41:50,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314977700] [2022-04-15 17:41:50,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:50,455 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-04-15 17:41:50,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:50,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 17:41:50,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:50,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 17:41:50,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:50,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 17:41:50,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:41:50,490 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 17:41:51,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:51,505 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-04-15 17:41:51,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 17:41:51,505 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-04-15 17:41:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 17:41:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 101 transitions. [2022-04-15 17:41:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 17:41:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 101 transitions. [2022-04-15 17:41:51,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 101 transitions. [2022-04-15 17:41:51,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:51,600 INFO L225 Difference]: With dead ends: 100 [2022-04-15 17:41:51,600 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 17:41:51,601 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2022-04-15 17:41:51,601 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 134 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:51,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 201 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 17:41:51,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 17:41:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-15 17:41:51,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:51,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 60 states have (on average 1.1) internal successors, (66), 61 states have internal predecessors, (66), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:41:51,764 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 60 states have (on average 1.1) internal successors, (66), 61 states have internal predecessors, (66), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:41:51,765 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 60 states have (on average 1.1) internal successors, (66), 61 states have internal predecessors, (66), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:41:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:51,765 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-04-15 17:41:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-04-15 17:41:51,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:51,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:51,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 60 states have (on average 1.1) internal successors, (66), 61 states have internal predecessors, (66), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 82 states. [2022-04-15 17:41:51,766 INFO L87 Difference]: Start difference. First operand has 82 states, 60 states have (on average 1.1) internal successors, (66), 61 states have internal predecessors, (66), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 82 states. [2022-04-15 17:41:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:51,767 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-04-15 17:41:51,767 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-04-15 17:41:51,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:51,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:51,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:51,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.1) internal successors, (66), 61 states have internal predecessors, (66), 13 states have call successors, (13), 12 states have call predecessors, (13), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 17:41:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-04-15 17:41:51,769 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 65 [2022-04-15 17:41:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:51,769 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-04-15 17:41:51,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 17:41:51,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 87 transitions. [2022-04-15 17:41:51,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-04-15 17:41:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 17:41:51,873 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:51,873 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:51,873 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 17:41:51,874 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:51,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1066121988, now seen corresponding path program 1 times [2022-04-15 17:41:51,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:51,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1565943264] [2022-04-15 17:41:51,874 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1066121988, now seen corresponding path program 2 times [2022-04-15 17:41:51,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:51,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897171581] [2022-04-15 17:41:51,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:51,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:51,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:51,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {22123#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {22084#true} is VALID [2022-04-15 17:41:51,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {22084#true} assume true; {22084#true} is VALID [2022-04-15 17:41:51,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22084#true} {22084#true} #780#return; {22084#true} is VALID [2022-04-15 17:41:51,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:51,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {22124#(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; {22084#true} is VALID [2022-04-15 17:41:51,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {22084#true} assume true; {22084#true} is VALID [2022-04-15 17:41:51,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22084#true} {22084#true} #714#return; {22084#true} is VALID [2022-04-15 17:41:51,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:51,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {22125#(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; {22084#true} is VALID [2022-04-15 17:41:51,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {22084#true} assume true; {22084#true} is VALID [2022-04-15 17:41:51,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22084#true} {22084#true} #716#return; {22084#true} is VALID [2022-04-15 17:41:51,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 17:41:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:51,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 17:41:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:51,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 17:41:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:51,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {22138#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:51,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {22122#(= ~setEventCalled~0 1)} assume true; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:51,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22122#(= ~setEventCalled~0 1)} {22084#true} #712#return; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:51,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {22138#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {22084#true} is VALID [2022-04-15 17:41:51,999 INFO L272 TraceCheckUtils]: 1: Hoare triple {22084#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {22138#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:52,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {22138#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,000 INFO L290 TraceCheckUtils]: 3: Hoare triple {22122#(= ~setEventCalled~0 1)} assume true; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,000 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22122#(= ~setEventCalled~0 1)} {22084#true} #712#return; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {22122#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {22122#(= ~setEventCalled~0 1)} assume true; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,001 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22122#(= ~setEventCalled~0 1)} {22084#true} #774#return; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 17:41:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:52,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {22142#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {22084#true} is VALID [2022-04-15 17:41:52,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {22084#true} assume true; {22084#true} is VALID [2022-04-15 17:41:52,009 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22084#true} {22122#(= ~setEventCalled~0 1)} #776#return; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {22126#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {22084#true} is VALID [2022-04-15 17:41:52,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {22084#true} assume 0 != ~compRegistered~0; {22084#true} is VALID [2022-04-15 17:41:52,010 INFO L272 TraceCheckUtils]: 2: Hoare triple {22084#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {22138#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:52,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {22138#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {22084#true} is VALID [2022-04-15 17:41:52,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {22084#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {22138#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:52,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {22138#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {22122#(= ~setEventCalled~0 1)} assume true; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,011 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22122#(= ~setEventCalled~0 1)} {22084#true} #712#return; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {22122#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {22122#(= ~setEventCalled~0 1)} assume true; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,013 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22122#(= ~setEventCalled~0 1)} {22084#true} #774#return; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {22122#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {22122#(= ~setEventCalled~0 1)} assume -1073741802 == ~__cil_tmp7~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,013 INFO L272 TraceCheckUtils]: 13: Hoare triple {22122#(= ~setEventCalled~0 1)} call stubMoreProcessingRequired(); {22142#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:52,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {22142#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {22084#true} is VALID [2022-04-15 17:41:52,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {22084#true} assume true; {22084#true} is VALID [2022-04-15 17:41:52,014 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22084#true} {22122#(= ~setEventCalled~0 1)} #776#return; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {22122#(= ~setEventCalled~0 1)} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {22122#(= ~setEventCalled~0 1)} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {22122#(= ~setEventCalled~0 1)} assume !(1 == ~tmp_ndt_7~0); {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {22122#(= ~setEventCalled~0 1)} ~returnVal2~0 := 259; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {22122#(= ~setEventCalled~0 1)} assume !(~s~0 == ~NP~0); {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {22122#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR1~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {22122#(= ~setEventCalled~0 1)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {22122#(= ~setEventCalled~0 1)} #res := ~returnVal2~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {22122#(= ~setEventCalled~0 1)} assume true; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,016 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22122#(= ~setEventCalled~0 1)} {22084#true} #752#return; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {22084#true} call ULTIMATE.init(); {22123#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:52,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {22123#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {22084#true} is VALID [2022-04-15 17:41:52,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {22084#true} assume true; {22084#true} is VALID [2022-04-15 17:41:52,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22084#true} {22084#true} #780#return; {22084#true} is VALID [2022-04-15 17:41:52,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {22084#true} call #t~ret83 := main(); {22084#true} is VALID [2022-04-15 17:41:52,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {22084#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;~DevicePowerState~0 := 1;~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; {22084#true} is VALID [2022-04-15 17:41:52,018 INFO L272 TraceCheckUtils]: 6: Hoare triple {22084#true} call _BLAST_init(); {22124#(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-15 17:41:52,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {22124#(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; {22084#true} is VALID [2022-04-15 17:41:52,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {22084#true} assume true; {22084#true} is VALID [2022-04-15 17:41:52,019 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {22084#true} {22084#true} #714#return; {22084#true} is VALID [2022-04-15 17:41:52,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {22084#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; {22084#true} is VALID [2022-04-15 17:41:52,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {22084#true} assume !(0 == ~irp_choice~0); {22084#true} is VALID [2022-04-15 17:41:52,019 INFO L272 TraceCheckUtils]: 12: Hoare triple {22084#true} call stub_driver_init(); {22125#(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-15 17:41:52,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {22125#(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; {22084#true} is VALID [2022-04-15 17:41:52,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {22084#true} assume true; {22084#true} is VALID [2022-04-15 17:41:52,019 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22084#true} {22084#true} #716#return; {22084#true} is VALID [2022-04-15 17:41:52,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {22084#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {22084#true} is VALID [2022-04-15 17:41:52,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {22084#true} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {22084#true} is VALID [2022-04-15 17:41:52,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {22084#true} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {22084#true} is VALID [2022-04-15 17:41:52,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {22084#true} assume 3 == ~tmp_ndt_3~0; {22084#true} is VALID [2022-04-15 17:41:52,020 INFO L272 TraceCheckUtils]: 20: Hoare triple {22084#true} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {22084#true} is VALID [2022-04-15 17:41:52,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {22084#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; {22084#true} is VALID [2022-04-15 17:41:52,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {22084#true} assume 0 == ~irpStack__MinorFunction~0; {22084#true} is VALID [2022-04-15 17:41:52,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {22084#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {22084#true} is VALID [2022-04-15 17:41:52,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {22084#true} assume !(~s~0 != ~NP~0); {22084#true} is VALID [2022-04-15 17:41:52,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {22084#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {22084#true} is VALID [2022-04-15 17:41:52,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {22084#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {22084#true} is VALID [2022-04-15 17:41:52,021 INFO L272 TraceCheckUtils]: 27: Hoare triple {22084#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {22126#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:52,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {22126#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {22084#true} is VALID [2022-04-15 17:41:52,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {22084#true} assume 0 != ~compRegistered~0; {22084#true} is VALID [2022-04-15 17:41:52,021 INFO L272 TraceCheckUtils]: 30: Hoare triple {22084#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {22138#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:52,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {22138#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {22084#true} is VALID [2022-04-15 17:41:52,022 INFO L272 TraceCheckUtils]: 32: Hoare triple {22084#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {22138#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:52,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {22138#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,022 INFO L290 TraceCheckUtils]: 34: Hoare triple {22122#(= ~setEventCalled~0 1)} assume true; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,023 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22122#(= ~setEventCalled~0 1)} {22084#true} #712#return; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {22122#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {22122#(= ~setEventCalled~0 1)} assume true; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,024 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22122#(= ~setEventCalled~0 1)} {22084#true} #774#return; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {22122#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {22122#(= ~setEventCalled~0 1)} assume -1073741802 == ~__cil_tmp7~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,025 INFO L272 TraceCheckUtils]: 41: Hoare triple {22122#(= ~setEventCalled~0 1)} call stubMoreProcessingRequired(); {22142#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:52,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {22142#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {22084#true} is VALID [2022-04-15 17:41:52,025 INFO L290 TraceCheckUtils]: 43: Hoare triple {22084#true} assume true; {22084#true} is VALID [2022-04-15 17:41:52,025 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {22084#true} {22122#(= ~setEventCalled~0 1)} #776#return; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {22122#(= ~setEventCalled~0 1)} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {22122#(= ~setEventCalled~0 1)} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,026 INFO L290 TraceCheckUtils]: 47: Hoare triple {22122#(= ~setEventCalled~0 1)} assume !(1 == ~tmp_ndt_7~0); {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,026 INFO L290 TraceCheckUtils]: 48: Hoare triple {22122#(= ~setEventCalled~0 1)} ~returnVal2~0 := 259; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {22122#(= ~setEventCalled~0 1)} assume !(~s~0 == ~NP~0); {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,027 INFO L290 TraceCheckUtils]: 50: Hoare triple {22122#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR1~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,027 INFO L290 TraceCheckUtils]: 51: Hoare triple {22122#(= ~setEventCalled~0 1)} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,027 INFO L290 TraceCheckUtils]: 52: Hoare triple {22122#(= ~setEventCalled~0 1)} #res := ~returnVal2~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,027 INFO L290 TraceCheckUtils]: 53: Hoare triple {22122#(= ~setEventCalled~0 1)} assume true; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,028 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22122#(= ~setEventCalled~0 1)} {22084#true} #752#return; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,028 INFO L290 TraceCheckUtils]: 55: Hoare triple {22122#(= ~setEventCalled~0 1)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {22122#(= ~setEventCalled~0 1)} assume 259 == ~__cil_tmp23~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,029 INFO L272 TraceCheckUtils]: 57: Hoare triple {22122#(= ~setEventCalled~0 1)} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,029 INFO L290 TraceCheckUtils]: 58: Hoare triple {22122#(= ~setEventCalled~0 1)} ~Object := #in~Object;~WaitReason := #in~WaitReason;~WaitMode := #in~WaitMode;~Alertable := #in~Alertable;~Timeout := #in~Timeout; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,029 INFO L290 TraceCheckUtils]: 59: Hoare triple {22122#(= ~setEventCalled~0 1)} assume ~s~0 == ~MPR3~0; {22122#(= ~setEventCalled~0 1)} is VALID [2022-04-15 17:41:52,030 INFO L290 TraceCheckUtils]: 60: Hoare triple {22122#(= ~setEventCalled~0 1)} assume !(1 == ~setEventCalled~0); {22085#false} is VALID [2022-04-15 17:41:52,030 INFO L290 TraceCheckUtils]: 61: Hoare triple {22085#false} assume !(1 == ~customIrp~0); {22085#false} is VALID [2022-04-15 17:41:52,030 INFO L290 TraceCheckUtils]: 62: Hoare triple {22085#false} assume ~s~0 == ~MPR3~0; {22085#false} is VALID [2022-04-15 17:41:52,030 INFO L272 TraceCheckUtils]: 63: Hoare triple {22085#false} call errorFn(); {22085#false} is VALID [2022-04-15 17:41:52,030 INFO L290 TraceCheckUtils]: 64: Hoare triple {22085#false} assume !false; {22085#false} is VALID [2022-04-15 17:41:52,030 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-15 17:41:52,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:52,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897171581] [2022-04-15 17:41:52,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897171581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:52,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:52,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 17:41:52,031 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:52,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1565943264] [2022-04-15 17:41:52,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1565943264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:52,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:52,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 17:41:52,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172749521] [2022-04-15 17:41:52,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:52,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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 65 [2022-04-15 17:41:52,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:52,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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-15 17:41:52,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:52,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 17:41:52,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:52,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 17:41:52,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-15 17:41:52,068 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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-15 17:41:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:52,630 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-04-15 17:41:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 17:41:52,630 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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 65 [2022-04-15 17:41:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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-15 17:41:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-04-15 17:41:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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-15 17:41:52,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-04-15 17:41:52,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 104 transitions. [2022-04-15 17:41:52,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:52,714 INFO L225 Difference]: With dead ends: 98 [2022-04-15 17:41:52,714 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 17:41:52,715 INFO L912 BasicCegarLoop]: 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-15 17:41:52,715 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 72 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:52,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 166 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:41:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 17:41:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-15 17:41:52,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:52,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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-15 17:41:52,860 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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-15 17:41:52,860 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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-15 17:41:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:52,861 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-15 17:41:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 17:41:52,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:52,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:52,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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 78 states. [2022-04-15 17:41:52,862 INFO L87 Difference]: Start difference. First operand has 78 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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 78 states. [2022-04-15 17:41:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:52,865 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-15 17:41:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 17:41:52,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:52,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:52,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:52,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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-15 17:41:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-15 17:41:52,867 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2022-04-15 17:41:52,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:52,867 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-15 17:41:52,867 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 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-15 17:41:52,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-15 17:41:52,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-15 17:41:52,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 17:41:52,976 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:52,977 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:52,977 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 17:41:52,977 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:52,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1874002193, now seen corresponding path program 1 times [2022-04-15 17:41:52,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:52,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [546045634] [2022-04-15 17:41:52,977 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:52,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1874002193, now seen corresponding path program 2 times [2022-04-15 17:41:52,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:52,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96854617] [2022-04-15 17:41:52,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:53,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:53,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {22699#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {22659#true} is VALID [2022-04-15 17:41:53,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22659#true} {22659#true} #780#return; {22659#true} is VALID [2022-04-15 17:41:53,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:53,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {22700#(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; {22659#true} is VALID [2022-04-15 17:41:53,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22659#true} {22659#true} #714#return; {22659#true} is VALID [2022-04-15 17:41:53,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:53,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {22701#(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; {22659#true} is VALID [2022-04-15 17:41:53,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,108 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22659#true} {22659#true} #716#return; {22659#true} is VALID [2022-04-15 17:41:53,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 17:41:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:53,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 17:41:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:53,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 17:41:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:53,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {22716#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {22659#true} is VALID [2022-04-15 17:41:53,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22659#true} {22659#true} #712#return; {22659#true} is VALID [2022-04-15 17:41:53,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {22716#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {22659#true} is VALID [2022-04-15 17:41:53,161 INFO L272 TraceCheckUtils]: 1: Hoare triple {22659#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {22716#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:53,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {22716#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {22659#true} is VALID [2022-04-15 17:41:53,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,161 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22659#true} {22659#true} #712#return; {22659#true} is VALID [2022-04-15 17:41:53,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {22659#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {22659#true} is VALID [2022-04-15 17:41:53,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,161 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22659#true} {22659#true} #774#return; {22659#true} is VALID [2022-04-15 17:41:53,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 17:41:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:53,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {22720#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {22659#true} is VALID [2022-04-15 17:41:53,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22659#true} {22659#true} #776#return; {22659#true} is VALID [2022-04-15 17:41:53,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {22702#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {22659#true} is VALID [2022-04-15 17:41:53,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {22659#true} assume 0 != ~compRegistered~0; {22659#true} is VALID [2022-04-15 17:41:53,174 INFO L272 TraceCheckUtils]: 2: Hoare triple {22659#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {22716#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:53,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {22716#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {22659#true} is VALID [2022-04-15 17:41:53,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {22659#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {22716#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:53,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {22716#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {22659#true} is VALID [2022-04-15 17:41:53,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,175 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22659#true} {22659#true} #712#return; {22659#true} is VALID [2022-04-15 17:41:53,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {22659#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {22659#true} is VALID [2022-04-15 17:41:53,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,175 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22659#true} {22659#true} #774#return; {22659#true} is VALID [2022-04-15 17:41:53,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {22659#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {22659#true} is VALID [2022-04-15 17:41:53,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {22659#true} assume -1073741802 == ~__cil_tmp7~0; {22659#true} is VALID [2022-04-15 17:41:53,175 INFO L272 TraceCheckUtils]: 13: Hoare triple {22659#true} call stubMoreProcessingRequired(); {22720#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:53,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {22720#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {22659#true} is VALID [2022-04-15 17:41:53,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,176 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {22659#true} {22659#true} #776#return; {22659#true} is VALID [2022-04-15 17:41:53,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {22659#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {22659#true} is VALID [2022-04-15 17:41:53,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {22659#true} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {22659#true} is VALID [2022-04-15 17:41:53,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {22659#true} assume !(1 == ~tmp_ndt_7~0); {22659#true} is VALID [2022-04-15 17:41:53,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {22659#true} ~returnVal2~0 := 259; {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:53,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:53,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:53,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:53,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {22715#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-15 17:41:53,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {22715#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} assume true; {22715#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-15 17:41:53,179 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {22715#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} {22659#true} #752#return; {22697#(and (<= |KbFilter_PnP_#t~ret12| 259) (< 258 |KbFilter_PnP_#t~ret12|))} is VALID [2022-04-15 17:41:53,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {22659#true} call ULTIMATE.init(); {22699#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:53,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {22699#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {22659#true} is VALID [2022-04-15 17:41:53,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22659#true} {22659#true} #780#return; {22659#true} is VALID [2022-04-15 17:41:53,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {22659#true} call #t~ret83 := main(); {22659#true} is VALID [2022-04-15 17:41:53,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {22659#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;~DevicePowerState~0 := 1;~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; {22659#true} is VALID [2022-04-15 17:41:53,181 INFO L272 TraceCheckUtils]: 6: Hoare triple {22659#true} call _BLAST_init(); {22700#(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-15 17:41:53,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {22700#(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; {22659#true} is VALID [2022-04-15 17:41:53,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,181 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {22659#true} {22659#true} #714#return; {22659#true} is VALID [2022-04-15 17:41:53,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {22659#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; {22659#true} is VALID [2022-04-15 17:41:53,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {22659#true} assume !(0 == ~irp_choice~0); {22659#true} is VALID [2022-04-15 17:41:53,182 INFO L272 TraceCheckUtils]: 12: Hoare triple {22659#true} call stub_driver_init(); {22701#(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-15 17:41:53,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {22701#(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; {22659#true} is VALID [2022-04-15 17:41:53,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,182 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22659#true} {22659#true} #716#return; {22659#true} is VALID [2022-04-15 17:41:53,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {22659#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {22659#true} is VALID [2022-04-15 17:41:53,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {22659#true} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {22659#true} is VALID [2022-04-15 17:41:53,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {22659#true} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {22659#true} is VALID [2022-04-15 17:41:53,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {22659#true} assume 3 == ~tmp_ndt_3~0; {22659#true} is VALID [2022-04-15 17:41:53,183 INFO L272 TraceCheckUtils]: 20: Hoare triple {22659#true} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {22659#true} is VALID [2022-04-15 17:41:53,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {22659#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; {22659#true} is VALID [2022-04-15 17:41:53,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {22659#true} assume 0 == ~irpStack__MinorFunction~0; {22659#true} is VALID [2022-04-15 17:41:53,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {22659#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {22659#true} is VALID [2022-04-15 17:41:53,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {22659#true} assume !(~s~0 != ~NP~0); {22659#true} is VALID [2022-04-15 17:41:53,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {22659#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {22659#true} is VALID [2022-04-15 17:41:53,183 INFO L290 TraceCheckUtils]: 26: Hoare triple {22659#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {22659#true} is VALID [2022-04-15 17:41:53,184 INFO L272 TraceCheckUtils]: 27: Hoare triple {22659#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {22702#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:53,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {22702#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {22659#true} is VALID [2022-04-15 17:41:53,184 INFO L290 TraceCheckUtils]: 29: Hoare triple {22659#true} assume 0 != ~compRegistered~0; {22659#true} is VALID [2022-04-15 17:41:53,184 INFO L272 TraceCheckUtils]: 30: Hoare triple {22659#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {22716#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:53,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {22716#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {22659#true} is VALID [2022-04-15 17:41:53,185 INFO L272 TraceCheckUtils]: 32: Hoare triple {22659#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {22716#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:53,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {22716#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {22659#true} is VALID [2022-04-15 17:41:53,185 INFO L290 TraceCheckUtils]: 34: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,185 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22659#true} {22659#true} #712#return; {22659#true} is VALID [2022-04-15 17:41:53,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {22659#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {22659#true} is VALID [2022-04-15 17:41:53,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,185 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {22659#true} {22659#true} #774#return; {22659#true} is VALID [2022-04-15 17:41:53,185 INFO L290 TraceCheckUtils]: 39: Hoare triple {22659#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {22659#true} is VALID [2022-04-15 17:41:53,186 INFO L290 TraceCheckUtils]: 40: Hoare triple {22659#true} assume -1073741802 == ~__cil_tmp7~0; {22659#true} is VALID [2022-04-15 17:41:53,186 INFO L272 TraceCheckUtils]: 41: Hoare triple {22659#true} call stubMoreProcessingRequired(); {22720#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:53,186 INFO L290 TraceCheckUtils]: 42: Hoare triple {22720#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {22659#true} is VALID [2022-04-15 17:41:53,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {22659#true} assume true; {22659#true} is VALID [2022-04-15 17:41:53,186 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {22659#true} {22659#true} #776#return; {22659#true} is VALID [2022-04-15 17:41:53,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {22659#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {22659#true} is VALID [2022-04-15 17:41:53,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {22659#true} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {22659#true} is VALID [2022-04-15 17:41:53,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {22659#true} assume !(1 == ~tmp_ndt_7~0); {22659#true} is VALID [2022-04-15 17:41:53,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {22659#true} ~returnVal2~0 := 259; {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:53,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume !(~s~0 == ~NP~0); {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:53,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume ~s~0 == ~MPR1~0; {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:53,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} is VALID [2022-04-15 17:41:53,188 INFO L290 TraceCheckUtils]: 52: Hoare triple {22714#(and (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0))} #res := ~returnVal2~0; {22715#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-15 17:41:53,188 INFO L290 TraceCheckUtils]: 53: Hoare triple {22715#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} assume true; {22715#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} is VALID [2022-04-15 17:41:53,189 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22715#(and (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259))} {22659#true} #752#return; {22697#(and (<= |KbFilter_PnP_#t~ret12| 259) (< 258 |KbFilter_PnP_#t~ret12|))} is VALID [2022-04-15 17:41:53,189 INFO L290 TraceCheckUtils]: 55: Hoare triple {22697#(and (<= |KbFilter_PnP_#t~ret12| 259) (< 258 |KbFilter_PnP_#t~ret12|))} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {22698#(= KbFilter_PnP_~__cil_tmp23~0 259)} is VALID [2022-04-15 17:41:53,189 INFO L290 TraceCheckUtils]: 56: Hoare triple {22698#(= KbFilter_PnP_~__cil_tmp23~0 259)} assume !(259 == ~__cil_tmp23~0); {22660#false} is VALID [2022-04-15 17:41:53,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {22660#false} assume ~status~0 >= 0; {22660#false} is VALID [2022-04-15 17:41:53,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {22660#false} assume ~myStatus~0 >= 0;~devExt__Started~0 := 1;~devExt__Removed~0 := 0;~devExt__SurpriseRemoved~0 := 0; {22660#false} is VALID [2022-04-15 17:41:53,190 INFO L290 TraceCheckUtils]: 59: Hoare triple {22660#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {22660#false} is VALID [2022-04-15 17:41:53,190 INFO L272 TraceCheckUtils]: 60: Hoare triple {22660#false} call IofCompleteRequest(~Irp, 0); {22660#false} is VALID [2022-04-15 17:41:53,190 INFO L290 TraceCheckUtils]: 61: Hoare triple {22660#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {22660#false} is VALID [2022-04-15 17:41:53,190 INFO L290 TraceCheckUtils]: 62: Hoare triple {22660#false} assume !(~s~0 == ~NP~0); {22660#false} is VALID [2022-04-15 17:41:53,190 INFO L272 TraceCheckUtils]: 63: Hoare triple {22660#false} call errorFn(); {22660#false} is VALID [2022-04-15 17:41:53,190 INFO L290 TraceCheckUtils]: 64: Hoare triple {22660#false} assume !false; {22660#false} is VALID [2022-04-15 17:41:53,190 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-15 17:41:53,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:53,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96854617] [2022-04-15 17:41:53,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96854617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:53,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:53,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:41:53,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:53,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [546045634] [2022-04-15 17:41:53,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [546045634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:53,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:53,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 17:41:53,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693146382] [2022-04-15 17:41:53,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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 65 [2022-04-15 17:41:53,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:53,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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-15 17:41:53,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:53,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 17:41:53,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:53,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 17:41:53,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-15 17:41:53,232 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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-15 17:41:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:53,937 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-04-15 17:41:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 17:41:53,937 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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 65 [2022-04-15 17:41:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:53,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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-15 17:41:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2022-04-15 17:41:53,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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-15 17:41:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2022-04-15 17:41:53,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 90 transitions. [2022-04-15 17:41:54,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:54,025 INFO L225 Difference]: With dead ends: 87 [2022-04-15 17:41:54,025 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 17:41:54,025 INFO L912 BasicCegarLoop]: 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-15 17:41:54,025 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 58 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:54,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 268 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:41:54,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 17:41:54,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-15 17:41:54,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:54,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 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-15 17:41:54,160 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 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-15 17:41:54,160 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 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-15 17:41:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:54,161 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-15 17:41:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-04-15 17:41:54,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:54,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:54,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 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 78 states. [2022-04-15 17:41:54,161 INFO L87 Difference]: Start difference. First operand has 78 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 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 78 states. [2022-04-15 17:41:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:54,162 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-15 17:41:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-04-15 17:41:54,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:54,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:54,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:54,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 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-15 17:41:54,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-04-15 17:41:54,163 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2022-04-15 17:41:54,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:54,163 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-04-15 17:41:54,163 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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-15 17:41:54,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 80 transitions. [2022-04-15 17:41:54,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-04-15 17:41:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 17:41:54,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:41:54,254 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:41:54,254 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 17:41:54,254 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:41:54,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:41:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2045810187, now seen corresponding path program 1 times [2022-04-15 17:41:54,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:54,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [126755656] [2022-04-15 17:41:54,255 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:41:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2045810187, now seen corresponding path program 2 times [2022-04-15 17:41:54,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:41:54,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275945973] [2022-04-15 17:41:54,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:41:54,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:41:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:41:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:54,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {23259#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {23211#true} is VALID [2022-04-15 17:41:54,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23211#true} {23211#true} #780#return; {23211#true} is VALID [2022-04-15 17:41:54,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:41:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:54,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {23260#(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; {23211#true} is VALID [2022-04-15 17:41:54,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23211#true} {23211#true} #714#return; {23211#true} is VALID [2022-04-15 17:41:54,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 17:41:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:54,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {23261#(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; {23211#true} is VALID [2022-04-15 17:41:54,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23211#true} {23211#true} #716#return; {23211#true} is VALID [2022-04-15 17:41:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 17:41:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:54,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-15 17:41:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:54,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-15 17:41:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:54,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {23274#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {23211#true} is VALID [2022-04-15 17:41:54,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23211#true} {23211#true} #712#return; {23211#true} is VALID [2022-04-15 17:41:54,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {23274#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {23211#true} is VALID [2022-04-15 17:41:54,431 INFO L272 TraceCheckUtils]: 1: Hoare triple {23211#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {23274#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:54,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {23274#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {23211#true} is VALID [2022-04-15 17:41:54,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,431 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {23211#true} {23211#true} #712#return; {23211#true} is VALID [2022-04-15 17:41:54,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {23211#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {23211#true} is VALID [2022-04-15 17:41:54,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,432 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23211#true} {23211#true} #774#return; {23211#true} is VALID [2022-04-15 17:41:54,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-15 17:41:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:54,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {23278#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {23211#true} is VALID [2022-04-15 17:41:54,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23211#true} {23211#true} #776#return; {23211#true} is VALID [2022-04-15 17:41:54,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {23262#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {23211#true} is VALID [2022-04-15 17:41:54,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {23211#true} assume 0 != ~compRegistered~0; {23211#true} is VALID [2022-04-15 17:41:54,438 INFO L272 TraceCheckUtils]: 2: Hoare triple {23211#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {23274#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:54,439 INFO L290 TraceCheckUtils]: 3: Hoare triple {23274#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {23211#true} is VALID [2022-04-15 17:41:54,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {23211#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {23274#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:54,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {23274#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {23211#true} is VALID [2022-04-15 17:41:54,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,439 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {23211#true} {23211#true} #712#return; {23211#true} is VALID [2022-04-15 17:41:54,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {23211#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {23211#true} is VALID [2022-04-15 17:41:54,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,440 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23211#true} {23211#true} #774#return; {23211#true} is VALID [2022-04-15 17:41:54,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {23211#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {23211#true} is VALID [2022-04-15 17:41:54,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {23211#true} assume -1073741802 == ~__cil_tmp7~0; {23211#true} is VALID [2022-04-15 17:41:54,441 INFO L272 TraceCheckUtils]: 13: Hoare triple {23211#true} call stubMoreProcessingRequired(); {23278#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:54,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {23278#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {23211#true} is VALID [2022-04-15 17:41:54,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,441 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {23211#true} {23211#true} #776#return; {23211#true} is VALID [2022-04-15 17:41:54,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {23211#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {23211#true} is VALID [2022-04-15 17:41:54,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {23211#true} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {23211#true} is VALID [2022-04-15 17:41:54,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {23211#true} assume !(1 == ~tmp_ndt_7~0); {23211#true} is VALID [2022-04-15 17:41:54,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {23211#true} ~returnVal2~0 := 259; {23211#true} is VALID [2022-04-15 17:41:54,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {23211#true} assume !(~s~0 == ~NP~0); {23211#true} is VALID [2022-04-15 17:41:54,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {23211#true} assume ~s~0 == ~MPR1~0; {23211#true} is VALID [2022-04-15 17:41:54,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {23211#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {23249#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 17:41:54,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {23249#(= ~MPR3~0 ~s~0)} #res := ~returnVal2~0; {23249#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 17:41:54,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {23249#(= ~MPR3~0 ~s~0)} assume true; {23249#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 17:41:54,443 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {23249#(= ~MPR3~0 ~s~0)} {23211#true} #752#return; {23249#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 17:41:54,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-04-15 17:41:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:41:54,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {23279#(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; {23278#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:54,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {23278#(= ~s~0 |old(~s~0)|)} assume !(~s~0 == ~MPR3~0); {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {23280#(not (= ~MPR3~0 |old(~s~0)|))} assume !(1 == ~customIrp~0); {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,460 INFO L290 TraceCheckUtils]: 3: Hoare triple {23280#(not (= ~MPR3~0 |old(~s~0)|))} assume !(~s~0 == ~MPR3~0); {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,461 INFO L290 TraceCheckUtils]: 4: Hoare triple {23280#(not (= ~MPR3~0 |old(~s~0)|))} havoc ~tmp_ndt_8~0;assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp_ndt_8~0 := #t~nondet41;havoc #t~nondet41; {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {23280#(not (= ~MPR3~0 |old(~s~0)|))} assume 0 == ~tmp_ndt_8~0; {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {23280#(not (= ~MPR3~0 |old(~s~0)|))} #res := 0; {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {23280#(not (= ~MPR3~0 |old(~s~0)|))} assume true; {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,462 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {23280#(not (= ~MPR3~0 |old(~s~0)|))} {23249#(= ~MPR3~0 ~s~0)} #754#return; {23212#false} is VALID [2022-04-15 17:41:54,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {23211#true} call ULTIMATE.init(); {23259#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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-15 17:41:54,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {23259#(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) (= |old(~DevicePowerState~0)| ~DevicePowerState~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(23, 2);call #Ultimate.allocInit(12, 3);~KernelMode~0 := 0;~Executive~0 := 0;~DevicePowerState~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; {23211#true} is VALID [2022-04-15 17:41:54,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23211#true} {23211#true} #780#return; {23211#true} is VALID [2022-04-15 17:41:54,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {23211#true} call #t~ret83 := main(); {23211#true} is VALID [2022-04-15 17:41:54,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {23211#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;~DevicePowerState~0 := 1;~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; {23211#true} is VALID [2022-04-15 17:41:54,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {23211#true} call _BLAST_init(); {23260#(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-15 17:41:54,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {23260#(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; {23211#true} is VALID [2022-04-15 17:41:54,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,465 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {23211#true} {23211#true} #714#return; {23211#true} is VALID [2022-04-15 17:41:54,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {23211#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; {23211#true} is VALID [2022-04-15 17:41:54,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {23211#true} assume !(0 == ~irp_choice~0); {23211#true} is VALID [2022-04-15 17:41:54,465 INFO L272 TraceCheckUtils]: 12: Hoare triple {23211#true} call stub_driver_init(); {23261#(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-15 17:41:54,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {23261#(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; {23211#true} is VALID [2022-04-15 17:41:54,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,465 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23211#true} {23211#true} #716#return; {23211#true} is VALID [2022-04-15 17:41:54,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {23211#true} assume !(~status~1 < 0);havoc ~tmp_ndt_1~0;assume -2147483648 <= #t~nondet26 && #t~nondet26 <= 2147483647;~tmp_ndt_1~0 := #t~nondet26;havoc #t~nondet26; {23211#true} is VALID [2022-04-15 17:41:54,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {23211#true} assume !(0 == ~tmp_ndt_1~0);havoc ~tmp_ndt_2~0;assume -2147483648 <= #t~nondet27 && #t~nondet27 <= 2147483647;~tmp_ndt_2~0 := #t~nondet27;havoc #t~nondet27; {23211#true} is VALID [2022-04-15 17:41:54,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {23211#true} assume !(1 == ~tmp_ndt_2~0);havoc ~tmp_ndt_3~0;assume -2147483648 <= #t~nondet28 && #t~nondet28 <= 2147483647;~tmp_ndt_3~0 := #t~nondet28;havoc #t~nondet28; {23211#true} is VALID [2022-04-15 17:41:54,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {23211#true} assume 3 == ~tmp_ndt_3~0; {23211#true} is VALID [2022-04-15 17:41:54,466 INFO L272 TraceCheckUtils]: 20: Hoare triple {23211#true} call #t~ret33 := KbFilter_PnP(~devobj~0, ~pirp~0); {23211#true} is VALID [2022-04-15 17:41:54,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {23211#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; {23211#true} is VALID [2022-04-15 17:41:54,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {23211#true} assume 0 == ~irpStack__MinorFunction~0; {23211#true} is VALID [2022-04-15 17:41:54,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {23211#true} ~irpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0;~nextIrpSp~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~nextIrpSp__Control~0 := 0; {23211#true} is VALID [2022-04-15 17:41:54,466 INFO L290 TraceCheckUtils]: 24: Hoare triple {23211#true} assume !(~s~0 != ~NP~0); {23211#true} is VALID [2022-04-15 17:41:54,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {23211#true} assume !(0 != ~compRegistered~0);~compRegistered~0 := 1; {23211#true} is VALID [2022-04-15 17:41:54,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {23211#true} ~irpSp___0~0 := ~Irp__Tail__Overlay__CurrentStackLocation~0 - 1;~irpSp__Context~0 := ~event~0;~irpSp__Control~0 := 224; {23211#true} is VALID [2022-04-15 17:41:54,467 INFO L272 TraceCheckUtils]: 27: Hoare triple {23211#true} call #t~ret12 := IofCallDriver(~devExt__TopOfStack~0, ~Irp); {23262#(and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {23262#(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~nondet36 && #t~nondet36 <= 2147483647;~lcontext~0 := #t~nondet36;havoc #t~nondet36;havoc ~__cil_tmp7~0; {23211#true} is VALID [2022-04-15 17:41:54,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {23211#true} assume 0 != ~compRegistered~0; {23211#true} is VALID [2022-04-15 17:41:54,467 INFO L272 TraceCheckUtils]: 30: Hoare triple {23211#true} call #t~ret37 := KbFilter_Complete(~DeviceObject, ~Irp, ~lcontext~0); {23274#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:54,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {23274#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~DeviceObject := #in~DeviceObject;~Irp := #in~Irp;~Context := #in~Context;havoc ~event~1;~event~1 := ~Context; {23211#true} is VALID [2022-04-15 17:41:54,468 INFO L272 TraceCheckUtils]: 32: Hoare triple {23211#true} call #t~ret42 := KeSetEvent(~event~1, 0, 0); {23274#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} is VALID [2022-04-15 17:41:54,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {23274#(= ~setEventCalled~0 |old(~setEventCalled~0)|)} ~Event := #in~Event;~Increment := #in~Increment;~Wait := #in~Wait;assume -2147483648 <= #t~nondet40 && #t~nondet40 <= 2147483647;~l~0 := #t~nondet40;havoc #t~nondet40;~setEventCalled~0 := 1;#res := ~l~0; {23211#true} is VALID [2022-04-15 17:41:54,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,468 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {23211#true} {23211#true} #712#return; {23211#true} is VALID [2022-04-15 17:41:54,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {23211#true} assume -2147483648 <= #t~ret42 && #t~ret42 <= 2147483647;havoc #t~ret42;#res := -1073741802; {23211#true} is VALID [2022-04-15 17:41:54,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,468 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {23211#true} {23211#true} #774#return; {23211#true} is VALID [2022-04-15 17:41:54,468 INFO L290 TraceCheckUtils]: 39: Hoare triple {23211#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;~compRetStatus~0 := #t~ret37;havoc #t~ret37;~__cil_tmp7~0 := ~compRetStatus~0; {23211#true} is VALID [2022-04-15 17:41:54,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {23211#true} assume -1073741802 == ~__cil_tmp7~0; {23211#true} is VALID [2022-04-15 17:41:54,469 INFO L272 TraceCheckUtils]: 41: Hoare triple {23211#true} call stubMoreProcessingRequired(); {23278#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:54,469 INFO L290 TraceCheckUtils]: 42: Hoare triple {23278#(= ~s~0 |old(~s~0)|)} assume ~s~0 == ~NP~0;~s~0 := ~MPR1~0; {23211#true} is VALID [2022-04-15 17:41:54,469 INFO L290 TraceCheckUtils]: 43: Hoare triple {23211#true} assume true; {23211#true} is VALID [2022-04-15 17:41:54,469 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {23211#true} {23211#true} #776#return; {23211#true} is VALID [2022-04-15 17:41:54,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {23211#true} havoc ~tmp_ndt_6~0;assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647;~tmp_ndt_6~0 := #t~nondet38;havoc #t~nondet38; {23211#true} is VALID [2022-04-15 17:41:54,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {23211#true} assume !(0 == ~tmp_ndt_6~0);havoc ~tmp_ndt_7~0;assume -2147483648 <= #t~nondet39 && #t~nondet39 <= 2147483647;~tmp_ndt_7~0 := #t~nondet39;havoc #t~nondet39; {23211#true} is VALID [2022-04-15 17:41:54,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {23211#true} assume !(1 == ~tmp_ndt_7~0); {23211#true} is VALID [2022-04-15 17:41:54,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {23211#true} ~returnVal2~0 := 259; {23211#true} is VALID [2022-04-15 17:41:54,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {23211#true} assume !(~s~0 == ~NP~0); {23211#true} is VALID [2022-04-15 17:41:54,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {23211#true} assume ~s~0 == ~MPR1~0; {23211#true} is VALID [2022-04-15 17:41:54,470 INFO L290 TraceCheckUtils]: 51: Hoare triple {23211#true} assume 259 == ~returnVal2~0;~s~0 := ~MPR3~0;~lowerDriverReturn~0 := ~returnVal2~0; {23249#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 17:41:54,470 INFO L290 TraceCheckUtils]: 52: Hoare triple {23249#(= ~MPR3~0 ~s~0)} #res := ~returnVal2~0; {23249#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 17:41:54,470 INFO L290 TraceCheckUtils]: 53: Hoare triple {23249#(= ~MPR3~0 ~s~0)} assume true; {23249#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 17:41:54,471 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {23249#(= ~MPR3~0 ~s~0)} {23211#true} #752#return; {23249#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 17:41:54,471 INFO L290 TraceCheckUtils]: 55: Hoare triple {23249#(= ~MPR3~0 ~s~0)} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~status~0 := #t~ret12;havoc #t~ret12;~__cil_tmp23~0 := ~status~0; {23249#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 17:41:54,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {23249#(= ~MPR3~0 ~s~0)} assume 259 == ~__cil_tmp23~0; {23249#(= ~MPR3~0 ~s~0)} is VALID [2022-04-15 17:41:54,472 INFO L272 TraceCheckUtils]: 57: Hoare triple {23249#(= ~MPR3~0 ~s~0)} call #t~ret13 := KeWaitForSingleObject(~event~0, ~Executive~0, ~KernelMode~0, 0, 0); {23279#(and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {23279#(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; {23278#(= ~s~0 |old(~s~0)|)} is VALID [2022-04-15 17:41:54,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {23278#(= ~s~0 |old(~s~0)|)} assume !(~s~0 == ~MPR3~0); {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,473 INFO L290 TraceCheckUtils]: 60: Hoare triple {23280#(not (= ~MPR3~0 |old(~s~0)|))} assume !(1 == ~customIrp~0); {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,473 INFO L290 TraceCheckUtils]: 61: Hoare triple {23280#(not (= ~MPR3~0 |old(~s~0)|))} assume !(~s~0 == ~MPR3~0); {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,473 INFO L290 TraceCheckUtils]: 62: Hoare triple {23280#(not (= ~MPR3~0 |old(~s~0)|))} havoc ~tmp_ndt_8~0;assume -2147483648 <= #t~nondet41 && #t~nondet41 <= 2147483647;~tmp_ndt_8~0 := #t~nondet41;havoc #t~nondet41; {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,473 INFO L290 TraceCheckUtils]: 63: Hoare triple {23280#(not (= ~MPR3~0 |old(~s~0)|))} assume 0 == ~tmp_ndt_8~0; {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,473 INFO L290 TraceCheckUtils]: 64: Hoare triple {23280#(not (= ~MPR3~0 |old(~s~0)|))} #res := 0; {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,474 INFO L290 TraceCheckUtils]: 65: Hoare triple {23280#(not (= ~MPR3~0 |old(~s~0)|))} assume true; {23280#(not (= ~MPR3~0 |old(~s~0)|))} is VALID [2022-04-15 17:41:54,474 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {23280#(not (= ~MPR3~0 |old(~s~0)|))} {23249#(= ~MPR3~0 ~s~0)} #754#return; {23212#false} is VALID [2022-04-15 17:41:54,475 INFO L290 TraceCheckUtils]: 67: Hoare triple {23212#false} assume -2147483648 <= #t~ret13 && #t~ret13 <= 2147483647;havoc #t~ret13; {23212#false} is VALID [2022-04-15 17:41:54,475 INFO L290 TraceCheckUtils]: 68: Hoare triple {23212#false} assume ~status~0 >= 0; {23212#false} is VALID [2022-04-15 17:41:54,475 INFO L290 TraceCheckUtils]: 69: Hoare triple {23212#false} assume ~myStatus~0 >= 0;~devExt__Started~0 := 1;~devExt__Removed~0 := 0;~devExt__SurpriseRemoved~0 := 0; {23212#false} is VALID [2022-04-15 17:41:54,475 INFO L290 TraceCheckUtils]: 70: Hoare triple {23212#false} ~Irp__IoStatus__Status~0 := ~status~0;~myStatus~0 := ~status~0;~Irp__IoStatus__Information~0 := 0; {23212#false} is VALID [2022-04-15 17:41:54,475 INFO L272 TraceCheckUtils]: 71: Hoare triple {23212#false} call IofCompleteRequest(~Irp, 0); {23212#false} is VALID [2022-04-15 17:41:54,475 INFO L290 TraceCheckUtils]: 72: Hoare triple {23212#false} ~Irp := #in~Irp;~PriorityBoost := #in~PriorityBoost; {23212#false} is VALID [2022-04-15 17:41:54,475 INFO L290 TraceCheckUtils]: 73: Hoare triple {23212#false} assume !(~s~0 == ~NP~0); {23212#false} is VALID [2022-04-15 17:41:54,475 INFO L272 TraceCheckUtils]: 74: Hoare triple {23212#false} call errorFn(); {23212#false} is VALID [2022-04-15 17:41:54,475 INFO L290 TraceCheckUtils]: 75: Hoare triple {23212#false} assume !false; {23212#false} is VALID [2022-04-15 17:41:54,475 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-15 17:41:54,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:41:54,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275945973] [2022-04-15 17:41:54,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275945973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:54,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:54,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 17:41:54,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:41:54,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [126755656] [2022-04-15 17:41:54,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [126755656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:41:54,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:41:54,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 17:41:54,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702818352] [2022-04-15 17:41:54,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:41:54,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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 76 [2022-04-15 17:41:54,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:41:54,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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-15 17:41:54,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:54,517 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 17:41:54,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:41:54,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 17:41:54,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-15 17:41:54,518 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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-15 17:41:55,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:55,106 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-04-15 17:41:55,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 17:41:55,106 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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 76 [2022-04-15 17:41:55,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:41:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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-15 17:41:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-15 17:41:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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-15 17:41:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-15 17:41:55,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2022-04-15 17:41:55,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:55,183 INFO L225 Difference]: With dead ends: 78 [2022-04-15 17:41:55,183 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 17:41:55,184 INFO L912 BasicCegarLoop]: 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-15 17:41:55,184 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 31 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 17:41:55,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 197 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 17:41:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 17:41:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 17:41:55,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:41:55,185 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-15 17:41:55,185 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-15 17:41:55,185 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-15 17:41:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:55,185 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 17:41:55,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 17:41:55,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:55,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:55,186 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-15 17:41:55,186 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-15 17:41:55,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:41:55,186 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 17:41:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 17:41:55,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:55,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:41:55,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:41:55,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:41:55,186 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-15 17:41:55,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 17:41:55,186 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-04-15 17:41:55,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:41:55,186 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 17:41:55,187 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 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-15 17:41:55,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 17:41:55,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:41:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 17:41:55,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:41:55,189 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 17:41:55,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 17:41:55,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 17:42:08,268 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 17:42:08,269 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 17:42:08,269 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 17:42:08,269 INFO L878 garLoopResultBuilder]: At program point L624(line 624) the Hoare annotation is: (or (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-04-15 17:42:08,269 INFO L878 garLoopResultBuilder]: At program point KbFilter_CompleteENTRY(lines 618 628) the Hoare annotation is: (or (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-04-15 17:42:08,269 INFO L878 garLoopResultBuilder]: At program point L624-1(line 624) the Hoare annotation is: (or (= ~setEventCalled~0 1) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-04-15 17:42:08,269 INFO L878 garLoopResultBuilder]: At program point KbFilter_CompleteFINAL(lines 618 628) the Hoare annotation is: (or (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (let ((.cse0 (+ 1073741802 |KbFilter_Complete_#res|))) (and (<= .cse0 0) (= ~setEventCalled~0 1) (<= 0 .cse0))) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-04-15 17:42:08,269 INFO L878 garLoopResultBuilder]: At program point KbFilter_CompleteEXIT(lines 618 628) the Hoare annotation is: (or (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (let ((.cse0 (+ 1073741802 |KbFilter_Complete_#res|))) (and (<= .cse0 0) (= ~setEventCalled~0 1) (<= 0 .cse0))) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-04-15 17:42:08,269 INFO L878 garLoopResultBuilder]: At program point _BLAST_initFINAL(lines 57 78) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (and (<= 6 ~MPR3~0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,270 INFO L878 garLoopResultBuilder]: At program point _BLAST_initENTRY(lines 57 78) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= ~s~0 ~DC~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= |old(~UNLOADED~0)| ~UNLOADED~0) (= ~compFptr~0 |old(~compFptr~0)|) (= ~pended~0 |old(~pended~0)|) (= ~s~0 ~NP~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,270 INFO L878 garLoopResultBuilder]: At program point _BLAST_initEXIT(lines 57 78) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (and (<= 6 ~MPR3~0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,270 INFO L878 garLoopResultBuilder]: At program point L415(lines 415 419) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= ~s~0 ~NP~0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,270 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 295 466) the Hoare annotation is: true [2022-04-15 17:42:08,270 INFO L878 garLoopResultBuilder]: At program point L374(lines 373 408) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,270 INFO L878 garLoopResultBuilder]: At program point L432(lines 432 459) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,270 INFO L878 garLoopResultBuilder]: At program point L358(lines 358 411) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,270 INFO L885 garLoopResultBuilder]: At program point L449(lines 449 457) the Hoare annotation is: true [2022-04-15 17:42:08,270 INFO L878 garLoopResultBuilder]: At program point L441(lines 432 459) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,270 INFO L878 garLoopResultBuilder]: At program point L433(lines 433 439) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,270 INFO L878 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,270 INFO L878 garLoopResultBuilder]: At program point L359(lines 358 411) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,271 INFO L885 garLoopResultBuilder]: At program point L450(lines 450 452) the Hoare annotation is: true [2022-04-15 17:42:08,271 INFO L878 garLoopResultBuilder]: At program point L376(lines 375 408) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (= main_~status~1 0) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,271 INFO L878 garLoopResultBuilder]: At program point L434(lines 434 436) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,271 INFO L878 garLoopResultBuilder]: At program point L368(lines 368 409) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,271 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 295 466) the Hoare annotation is: true [2022-04-15 17:42:08,271 INFO L878 garLoopResultBuilder]: At program point L385(line 385) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,271 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 295 466) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= |old(~Executive~0)| ~Executive~0) (<= ~s~0 ~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)|) (= ~pended~0 |old(~pended~0)|) (= ~s~0 ~NP~0) (= ~IPC~0 |old(~IPC~0)|) (= |old(~SKIP2~0)| ~SKIP2~0) (= |old(~DevicePowerState~0)| ~DevicePowerState~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0) (= ~s~0 |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,271 INFO L878 garLoopResultBuilder]: At program point L443(lines 443 447) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,271 INFO L878 garLoopResultBuilder]: At program point L344(lines 330 413) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,271 INFO L878 garLoopResultBuilder]: At program point L369(lines 368 409) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,271 INFO L878 garLoopResultBuilder]: At program point L328(line 328) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (<= ~s~0 ~DC~0) (= main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,272 INFO L878 garLoopResultBuilder]: At program point L328-1(lines 324 465) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,272 INFO L878 garLoopResultBuilder]: At program point L353(lines 353 412) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,272 INFO L878 garLoopResultBuilder]: At program point L395(line 395) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,272 INFO L878 garLoopResultBuilder]: At program point L354(lines 353 412) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,272 INFO L878 garLoopResultBuilder]: At program point L445(line 445) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,272 INFO L878 garLoopResultBuilder]: At program point L429(lines 422 462) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,272 INFO L878 garLoopResultBuilder]: At program point L363(lines 363 410) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,272 INFO L878 garLoopResultBuilder]: At program point L330(lines 324 465) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,272 INFO L885 garLoopResultBuilder]: At program point L454(lines 454 456) the Hoare annotation is: true [2022-04-15 17:42:08,272 INFO L878 garLoopResultBuilder]: At program point L421(lines 414 463) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,272 INFO L878 garLoopResultBuilder]: At program point L380(line 380) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,272 INFO L878 garLoopResultBuilder]: At program point L339(lines 339 342) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,273 INFO L878 garLoopResultBuilder]: At program point L339-2(lines 339 342) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,273 INFO L885 garLoopResultBuilder]: At program point L430(lines 414 463) the Hoare annotation is: true [2022-04-15 17:42:08,273 INFO L878 garLoopResultBuilder]: At program point L364(lines 363 410) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 6 ~MPR3~0) (= main_~status~1 0) (<= 7 ~IPC~0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (= ~NP~0 1) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,273 INFO L878 garLoopResultBuilder]: At program point L373(lines 373 408) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (and (= main_~status~1 0) (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= 4 ~SKIP2~0) (= ~compRegistered~0 0)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,273 INFO L878 garLoopResultBuilder]: At program point L431(lines 431 460) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (not (= ~pended~0 1)) (or (= ~compRegistered~0 1) (<= ~compRegistered~0 0)) (<= 4 ~SKIP2~0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,273 INFO L878 garLoopResultBuilder]: At program point L423(lines 423 427) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,273 INFO L878 garLoopResultBuilder]: At program point L390(line 390) the Hoare annotation is: (or (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (<= |old(~DC~0)| |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (<= 7 ~IPC~0) (= 2 ~DC~0) (let ((.cse0 (= main_~status~1 0))) (or (and (= ~compRegistered~0 1) .cse0) (and .cse0 (<= ~compRegistered~0 0)))) (not (= ~pended~0 1)) (<= 4 ~SKIP2~0)) (not (<= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|))) [2022-04-15 17:42:08,273 INFO L878 garLoopResultBuilder]: At program point L475(line 475) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1))) [2022-04-15 17:42:08,273 INFO L878 garLoopResultBuilder]: At program point L475-1(lines 467 480) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (= ~MPR1~0 ~s~0) (not (= ~compRegistered~0 1))) [2022-04-15 17:42:08,273 INFO L878 garLoopResultBuilder]: At program point stubMoreProcessingRequiredENTRY(lines 467 480) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (= ~s~0 |old(~s~0)|) (not (= ~compRegistered~0 1))) [2022-04-15 17:42:08,273 INFO L878 garLoopResultBuilder]: At program point stubMoreProcessingRequiredEXIT(lines 467 480) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= ~setEventCalled~0 1)) (not (= 2 ~DC~0)) (= ~MPR1~0 ~s~0) (not (= ~compRegistered~0 1))) [2022-04-15 17:42:08,273 INFO L878 garLoopResultBuilder]: At program point L762(line 762) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,274 INFO L885 garLoopResultBuilder]: At program point PoCallDriverEXIT(lines 745 821) the Hoare annotation is: true [2022-04-15 17:42:08,274 INFO L878 garLoopResultBuilder]: At program point L754(lines 754 766) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,274 INFO L878 garLoopResultBuilder]: At program point L754-1(lines 754 766) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,274 INFO L878 garLoopResultBuilder]: At program point L775(lines 774 791) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,274 INFO L878 garLoopResultBuilder]: At program point L800(lines 800 806) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,274 INFO L885 garLoopResultBuilder]: At program point PoCallDriverFINAL(lines 745 821) the Hoare annotation is: true [2022-04-15 17:42:08,274 INFO L878 garLoopResultBuilder]: At program point PoCallDriverENTRY(lines 745 821) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,274 INFO L878 garLoopResultBuilder]: At program point L809(lines 809 816) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,274 INFO L878 garLoopResultBuilder]: At program point L797(lines 797 817) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,274 INFO L878 garLoopResultBuilder]: At program point L760(lines 760 764) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,274 INFO L878 garLoopResultBuilder]: At program point L789(lines 753 820) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,274 INFO L878 garLoopResultBuilder]: At program point L756(line 756) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,274 INFO L878 garLoopResultBuilder]: At program point L756-1(line 756) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,274 INFO L878 garLoopResultBuilder]: At program point L814(line 814) the Hoare annotation is: (or (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,275 INFO L885 garLoopResultBuilder]: At program point L814-1(lines 793 818) the Hoare annotation is: true [2022-04-15 17:42:08,275 INFO L878 garLoopResultBuilder]: At program point L777(lines 776 791) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,275 INFO L878 garLoopResultBuilder]: At program point L769(lines 769 792) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,275 INFO L878 garLoopResultBuilder]: At program point L774(lines 774 791) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,275 INFO L878 garLoopResultBuilder]: At program point L770(lines 769 792) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,275 INFO L878 garLoopResultBuilder]: At program point L638(lines 638 656) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,275 INFO L885 garLoopResultBuilder]: At program point KbFilter_CreateCloseEXIT(lines 629 664) the Hoare annotation is: true [2022-04-15 17:42:08,275 INFO L878 garLoopResultBuilder]: At program point L653(lines 641 655) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,275 INFO L878 garLoopResultBuilder]: At program point L645(lines 638 656) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,275 INFO L878 garLoopResultBuilder]: At program point L641(lines 641 655) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,275 INFO L878 garLoopResultBuilder]: At program point KbFilter_CreateCloseENTRY(lines 629 664) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,275 INFO L878 garLoopResultBuilder]: At program point L660(line 660) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,275 INFO L885 garLoopResultBuilder]: At program point L660-1(line 660) the Hoare annotation is: true [2022-04-15 17:42:08,276 INFO L885 garLoopResultBuilder]: At program point KbFilter_CreateCloseFINAL(lines 629 664) the Hoare annotation is: true [2022-04-15 17:42:08,276 INFO L878 garLoopResultBuilder]: At program point L644(lines 644 654) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,276 INFO L878 garLoopResultBuilder]: At program point L956(lines 956 958) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,276 INFO L878 garLoopResultBuilder]: At program point L956-2(lines 934 971) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,276 INFO L885 garLoopResultBuilder]: At program point KbFilter_InternIoCtlEXIT(lines 822 1007) the Hoare annotation is: true [2022-04-15 17:42:08,276 INFO L878 garLoopResultBuilder]: At program point L940(lines 940 943) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,276 INFO L878 garLoopResultBuilder]: At program point L903(lines 903 982) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,276 INFO L878 garLoopResultBuilder]: At program point L924(lines 924 976) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,276 INFO L878 garLoopResultBuilder]: At program point L891(lines 891 986) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,276 INFO L878 garLoopResultBuilder]: At program point L883(lines 883 988) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,276 INFO L878 garLoopResultBuilder]: At program point L875(lines 875 990) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,276 INFO L878 garLoopResultBuilder]: At program point L1003(line 1003) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,276 INFO L885 garLoopResultBuilder]: At program point L1003-1(line 1003) the Hoare annotation is: true [2022-04-15 17:42:08,276 INFO L878 garLoopResultBuilder]: At program point L896(lines 896 984) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,277 INFO L878 garLoopResultBuilder]: At program point L892(lines 891 986) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,277 INFO L878 garLoopResultBuilder]: At program point L917(lines 917 978) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,277 INFO L878 garLoopResultBuilder]: At program point L884(lines 883 988) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,277 INFO L878 garLoopResultBuilder]: At program point L934(lines 934 973) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,277 INFO L878 garLoopResultBuilder]: At program point L959-1(lines 959 961) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,277 INFO L878 garLoopResultBuilder]: At program point KbFilter_InternIoCtlENTRY(lines 822 1007) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,277 INFO L878 garLoopResultBuilder]: At program point L910(lines 910 980) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,277 INFO L878 garLoopResultBuilder]: At program point L972(lines 867 1006) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,277 INFO L878 garLoopResultBuilder]: At program point L935(lines 875 990) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,277 INFO L878 garLoopResultBuilder]: At program point L997(line 997) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,277 INFO L878 garLoopResultBuilder]: At program point L997-1(line 997) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (= 2 ~s~0) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,277 INFO L885 garLoopResultBuilder]: At program point KbFilter_InternIoCtlFINAL(lines 822 1007) the Hoare annotation is: true [2022-04-15 17:42:08,277 INFO L878 garLoopResultBuilder]: At program point L931(lines 931 974) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,278 INFO L878 garLoopResultBuilder]: At program point L603(lines 603 615) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-04-15 17:42:08,278 INFO L878 garLoopResultBuilder]: At program point KeWaitForSingleObjectEXIT(lines 576 617) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-04-15 17:42:08,278 INFO L878 garLoopResultBuilder]: At program point L589(lines 581 600) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-04-15 17:42:08,278 INFO L878 garLoopResultBuilder]: At program point L581(lines 581 600) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-15 17:42:08,278 INFO L878 garLoopResultBuilder]: At program point L606(lines 605 615) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-04-15 17:42:08,278 INFO L878 garLoopResultBuilder]: At program point KeWaitForSingleObjectFINAL(lines 576 617) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-04-15 17:42:08,278 INFO L878 garLoopResultBuilder]: At program point L604(lines 603 615) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-04-15 17:42:08,278 INFO L878 garLoopResultBuilder]: At program point L596(line 596) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-04-15 17:42:08,278 INFO L878 garLoopResultBuilder]: At program point L594(lines 594 598) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))) (or .cse0 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7))) [2022-04-15 17:42:08,278 INFO L878 garLoopResultBuilder]: At program point L594-1(lines 581 600) the Hoare annotation is: (let ((.cse9 (= 2 ~DC~0)) (.cse1 (= ~pended~0 1)) (.cse10 (<= 4 ~SKIP2~0)) (.cse11 (<= 7 ~IPC~0))) (let ((.cse0 (not (= ~NP~0 1))) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not .cse11)) (.cse4 (and .cse11 .cse9 (not .cse1) (= ~s~0 ~NP~0) .cse10)) (.cse5 (not .cse10)) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not .cse9)) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|)))))) [2022-04-15 17:42:08,279 INFO L878 garLoopResultBuilder]: At program point KeWaitForSingleObjectENTRY(lines 576 617) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|))) (.cse2 (= ~pended~0 1)) (.cse3 (not (<= 5 ~MPR1~0))) (.cse4 (not (<= 7 ~IPC~0))) (.cse5 (not (<= 4 ~SKIP2~0))) (.cse6 (not (<= 6 ~MPR3~0))) (.cse7 (not (= 2 ~DC~0))) (.cse8 (not (= ~compRegistered~0 1)))) (and (or .cse0 .cse1 (not (= ~NP~0 |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~setEventCalled~0)| 1)) .cse7 .cse8 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-15 17:42:08,279 INFO L878 garLoopResultBuilder]: At program point L582(lines 582 587) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 1))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 5 ~MPR1~0))) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (<= 6 ~MPR3~0))) (.cse6 (not (= 2 ~DC~0))) (.cse7 (not (= ~compRegistered~0 1)))) (and (or .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~s~0 |old(~s~0)|)) .cse1 .cse2 .cse3 .cse4 .cse5 (not (= |old(~setEventCalled~0)| 1)) .cse6 .cse7 (not (= ~MPR3~0 |old(~s~0)|))))) [2022-04-15 17:42:08,279 INFO L878 garLoopResultBuilder]: At program point L562-1(lines 554 567) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (= 2 ~s~0)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,279 INFO L878 garLoopResultBuilder]: At program point L558(lines 558 564) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0))) (.cse5 (= ~s~0 |old(~s~0)|))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,279 INFO L878 garLoopResultBuilder]: At program point IofCompleteRequestENTRY(lines 554 567) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0))) (.cse5 (= ~s~0 |old(~s~0)|))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,279 INFO L878 garLoopResultBuilder]: At program point IofCompleteRequestEXIT(lines 554 567) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (= 2 ~s~0)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,279 INFO L878 garLoopResultBuilder]: At program point L562(line 562) the Hoare annotation is: (let ((.cse0 (not (= ~NP~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0)))) (and (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,279 INFO L878 garLoopResultBuilder]: At program point L258-1(lines 254 260) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,279 INFO L878 garLoopResultBuilder]: At program point L159(lines 159 274) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,279 INFO L878 garLoopResultBuilder]: At program point L126(lines 126 285) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,279 INFO L878 garLoopResultBuilder]: At program point L184(line 184) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,280 INFO L878 garLoopResultBuilder]: At program point L201(lines 201 203) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1))) (or (not (= ~NP~0 1)) (and .cse0 (= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and .cse0 (= ~s~0 |old(~s~0)|)))) [2022-04-15 17:42:08,280 INFO L878 garLoopResultBuilder]: At program point L168(lines 168 271) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,280 INFO L878 garLoopResultBuilder]: At program point L201-1(lines 201 203) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,280 INFO L878 garLoopResultBuilder]: At program point L135(lines 135 282) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,280 INFO L878 garLoopResultBuilder]: At program point L218(line 218) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,280 INFO L878 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,280 INFO L878 garLoopResultBuilder]: At program point L243-1(lines 239 245) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,280 INFO L878 garLoopResultBuilder]: At program point L177(lines 177 189) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,280 INFO L878 garLoopResultBuilder]: At program point L144(lines 144 279) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,280 INFO L878 garLoopResultBuilder]: At program point L111(lines 111 290) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,280 INFO L878 garLoopResultBuilder]: At program point L227(line 227) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,280 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 195) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and (= ~compRegistered~0 1) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~s~0 |old(~s~0)|))) [2022-04-15 17:42:08,281 INFO L878 garLoopResultBuilder]: At program point L227-1(lines 223 229) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,281 INFO L878 garLoopResultBuilder]: At program point L194-1(lines 194 195) the Hoare annotation is: (let ((.cse1 (= KbFilter_PnP_~status~0 0)) (.cse0 (= ~compRegistered~0 1))) (or (and .cse0 (= ~setEventCalled~0 1) (<= |KbFilter_PnP_#t~ret12| 259) (<= 259 |KbFilter_PnP_#t~ret12|) .cse1 (= ~MPR3~0 ~s~0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse1 (= ~s~0 |old(~s~0)|)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (and .cse0 (= |KbFilter_PnP_#t~ret12| 0) (= ~s~0 ~NP~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)))) [2022-04-15 17:42:08,281 INFO L878 garLoopResultBuilder]: At program point L153(lines 153 276) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,281 INFO L878 garLoopResultBuilder]: At program point L120(lines 120 287) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,281 INFO L878 garLoopResultBuilder]: At program point KbFilter_PnPEXIT(lines 81 294) the Hoare annotation is: (or (= ~compRegistered~0 1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (<= ~compRegistered~0 0) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,281 INFO L878 garLoopResultBuilder]: At program point L112(lines 111 290) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,281 INFO L878 garLoopResultBuilder]: At program point L269(lines 172 270) the Hoare annotation is: (or (= ~compRegistered~0 1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (<= ~compRegistered~0 0) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,281 INFO L878 garLoopResultBuilder]: At program point L162(lines 162 273) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,281 INFO L878 garLoopResultBuilder]: At program point L129(lines 129 284) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,281 INFO L878 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,281 INFO L878 garLoopResultBuilder]: At program point KbFilter_PnPENTRY(lines 81 294) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,281 INFO L878 garLoopResultBuilder]: At program point L171(lines 117 288) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point L138(lines 138 281) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point KbFilter_PnPFINAL(lines 81 294) the Hoare annotation is: (or (= ~compRegistered~0 1) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (<= ~compRegistered~0 0) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point L147(lines 147 278) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point L114(lines 114 289) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point L156(lines 156 275) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point L123(lines 123 286) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point L115(lines 114 289) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point L239(lines 239 245) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point L264(lines 264 265) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point L264-1(lines 264 265) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (= ~compRegistered~0 0)) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point L165(lines 165 272) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point L132(lines 132 283) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,282 INFO L878 garLoopResultBuilder]: At program point L223(lines 223 229) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,283 INFO L878 garLoopResultBuilder]: At program point L182(lines 182 188) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,283 INFO L878 garLoopResultBuilder]: At program point L182-1(lines 177 189) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and (= ~compRegistered~0 1) (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~s~0 |old(~s~0)|))) [2022-04-15 17:42:08,283 INFO L878 garLoopResultBuilder]: At program point L207(lines 207 213) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,283 INFO L878 garLoopResultBuilder]: At program point L141(lines 141 280) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,283 INFO L878 garLoopResultBuilder]: At program point L108(lines 108 291) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,283 INFO L878 garLoopResultBuilder]: At program point L199(lines 199 205) the Hoare annotation is: (let ((.cse0 (= ~compRegistered~0 1))) (or (not (= ~NP~0 1)) (and .cse0 (= ~setEventCalled~0 1) (= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~MPR3~0 ~s~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (and .cse0 (= ~s~0 |old(~s~0)|)))) [2022-04-15 17:42:08,283 INFO L878 garLoopResultBuilder]: At program point L199-2(lines 172 268) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,283 INFO L878 garLoopResultBuilder]: At program point L249(line 249) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,283 INFO L878 garLoopResultBuilder]: At program point L249-1(line 249) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (= ~compRegistered~0 0)) [2022-04-15 17:42:08,283 INFO L878 garLoopResultBuilder]: At program point L150(lines 150 277) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,283 INFO L878 garLoopResultBuilder]: At program point L117(lines 117 288) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~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 (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,283 INFO L878 garLoopResultBuilder]: At program point L208(lines 208 212) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= ~compRegistered~0 1) (= ~s~0 ~NP~0)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,284 INFO L878 garLoopResultBuilder]: At program point L109(lines 108 291) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (and (= |old(~customIrp~0)| ~customIrp~0) (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~myStatus~0 |old(~myStatus~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= KbFilter_PnP_~status~0 0) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,284 INFO L878 garLoopResultBuilder]: At program point L233(lines 233 234) the Hoare annotation is: (or (and (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,284 INFO L878 garLoopResultBuilder]: At program point L233-1(lines 233 234) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (= ~compRegistered~0 0)) [2022-04-15 17:42:08,284 INFO L878 garLoopResultBuilder]: At program point L258(line 258) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,284 INFO L878 garLoopResultBuilder]: At program point KeSetEventENTRY(lines 568 575) the Hoare annotation is: (or (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-04-15 17:42:08,284 INFO L878 garLoopResultBuilder]: At program point KeSetEventFINAL(lines 568 575) the Hoare annotation is: (or (= ~setEventCalled~0 1) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-04-15 17:42:08,284 INFO L878 garLoopResultBuilder]: At program point KeSetEventEXIT(lines 568 575) the Hoare annotation is: (or (= ~setEventCalled~0 1) (= ~pended~0 1) (not (= ~s~0 ~NP~0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)) (not (= ~s~0 1))) [2022-04-15 17:42:08,284 INFO L878 garLoopResultBuilder]: At program point L700(lines 700 729) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,284 INFO L885 garLoopResultBuilder]: At program point KbFilter_PowerEXIT(lines 689 744) the Hoare annotation is: true [2022-04-15 17:42:08,284 INFO L878 garLoopResultBuilder]: At program point L709(lines 709 726) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,284 INFO L878 garLoopResultBuilder]: At program point L740(line 740) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,284 INFO L878 garLoopResultBuilder]: At program point KbFilter_PowerENTRY(lines 689 744) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,284 INFO L885 garLoopResultBuilder]: At program point L740-1(line 740) the Hoare annotation is: true [2022-04-15 17:42:08,284 INFO L878 garLoopResultBuilder]: At program point L703(lines 703 728) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,285 INFO L878 garLoopResultBuilder]: At program point L734(line 734) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,285 INFO L878 garLoopResultBuilder]: At program point L701(lines 700 729) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,285 INFO L878 garLoopResultBuilder]: At program point L734-1(lines 730 736) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,285 INFO L878 garLoopResultBuilder]: At program point L724(lines 699 743) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,285 INFO L885 garLoopResultBuilder]: At program point KbFilter_PowerFINAL(lines 689 744) the Hoare annotation is: true [2022-04-15 17:42:08,285 INFO L878 garLoopResultBuilder]: At program point L706(lines 706 727) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,285 INFO L878 garLoopResultBuilder]: At program point stub_driver_initEXIT(lines 43 56) the Hoare annotation is: (or (and (not (= ~pended~0 1)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,285 INFO L878 garLoopResultBuilder]: At program point stub_driver_initENTRY(lines 43 56) the Hoare annotation is: (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (and (= |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)|) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,285 INFO L878 garLoopResultBuilder]: At program point stub_driver_initFINAL(lines 43 56) the Hoare annotation is: (or (and (not (= ~pended~0 1)) (= ~compRegistered~0 0) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) (= |old(~pended~0)| 1) (not (= |old(~compRegistered~0)| 0)) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,285 INFO L885 garLoopResultBuilder]: At program point errorFnENTRY(lines 1009 1016) the Hoare annotation is: true [2022-04-15 17:42:08,285 INFO L885 garLoopResultBuilder]: At program point errorFnFINAL(lines 1009 1016) the Hoare annotation is: true [2022-04-15 17:42:08,285 INFO L885 garLoopResultBuilder]: At program point errorFnEXIT(lines 1009 1016) the Hoare annotation is: true [2022-04-15 17:42:08,285 INFO L885 garLoopResultBuilder]: At program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) the Hoare annotation is: true [2022-04-15 17:42:08,286 INFO L878 garLoopResultBuilder]: At program point L510(lines 509 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-15 17:42:08,286 INFO L878 garLoopResultBuilder]: At program point L532(lines 532 549) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (let ((.cse0 (= ~MPR1~0 ~s~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0) .cse0) (not (= ~NP~0 1)) (and (<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0) .cse0 .cse1) (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 5 ~MPR1~0)) .cse3 .cse4 (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse0 .cse1) (not (<= 6 ~MPR3~0)) .cse5 (not (= ~compRegistered~0 1)))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5))) [2022-04-15 17:42:08,286 INFO L878 garLoopResultBuilder]: At program point IofCallDriverENTRY(lines 481 553) the Hoare annotation is: (let ((.cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 (not (<= 5 ~MPR1~0)) .cse2 .cse3 (not (<= 6 ~MPR3~0)) .cse4 (not (= ~compRegistered~0 1))) (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-04-15 17:42:08,286 INFO L878 garLoopResultBuilder]: At program point L495(lines 495 499) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,286 INFO L878 garLoopResultBuilder]: At program point L524(lines 488 552) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (let ((.cse0 (= ~MPR1~0 ~s~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (not (= ~NP~0 1)) (and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0) .cse0 .cse1) (and (<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0) .cse0 .cse1) (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 5 ~MPR1~0)) .cse3 .cse4 (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse0 .cse1) (not (<= 6 ~MPR3~0)) .cse5 (not (= ~compRegistered~0 1)))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5))) [2022-04-15 17:42:08,286 INFO L878 garLoopResultBuilder]: At program point L491(line 491) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (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)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,286 INFO L878 garLoopResultBuilder]: At program point L491-1(line 491) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~setEventCalled~0 1) (= (+ |IofCallDriver_#t~ret37| 1073741802) 0) (= ~s~0 |old(~s~0)|)) .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,286 INFO L878 garLoopResultBuilder]: At program point IofCallDriverFINAL(lines 481 553) the Hoare annotation is: (let ((.cse0 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (.cse1 (= ~s~0 ~NP~0))) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259) (<= 259 IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) .cse0) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and .cse1 .cse0) (and .cse1 (<= IofCallDriver_~returnVal2~0 0) (<= 0 |IofCallDriver_#res|) (<= 0 IofCallDriver_~returnVal2~0) (<= |IofCallDriver_#res| 0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)))) [2022-04-15 17:42:08,286 INFO L878 garLoopResultBuilder]: At program point L512(lines 511 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,287 INFO L878 garLoopResultBuilder]: At program point L541(lines 541 548) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-15 17:42:08,287 INFO L878 garLoopResultBuilder]: At program point L504(lines 504 527) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,287 INFO L878 garLoopResultBuilder]: At program point IofCallDriverEXIT(lines 481 553) the Hoare annotation is: (let ((.cse0 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (.cse1 (= ~s~0 ~NP~0))) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 |IofCallDriver_#res|) (<= |IofCallDriver_#res| 259) (<= 259 IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) .cse0) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (and .cse1 .cse0) (and .cse1 (<= IofCallDriver_~returnVal2~0 0) (<= 0 |IofCallDriver_#res|) (<= 0 IofCallDriver_~returnVal2~0) (<= |IofCallDriver_#res| 0)) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)))) [2022-04-15 17:42:08,287 INFO L878 garLoopResultBuilder]: At program point L533(lines 533 539) the Hoare annotation is: (let ((.cse2 (= ~pended~0 1)) (.cse3 (not (<= 7 ~IPC~0))) (.cse4 (not (<= 4 ~SKIP2~0))) (.cse5 (not (= 2 ~DC~0)))) (and (let ((.cse0 (= ~MPR1~0 ~s~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (and (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0) .cse0) (not (= ~NP~0 1)) (and (<= (+ 1073741823 IofCallDriver_~returnVal2~0) 0) .cse0 .cse1) (not (= ~NP~0 |old(~s~0)|)) .cse2 (not (<= 5 ~MPR1~0)) .cse3 .cse4 (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) .cse0 .cse1) (not (<= 6 ~MPR3~0)) .cse5 (not (= ~compRegistered~0 1)))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse2 .cse3 .cse4 (not (= ~SKIP1~0 |old(~s~0)|)) .cse5))) [2022-04-15 17:42:08,287 INFO L878 garLoopResultBuilder]: At program point L546(line 546) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,287 INFO L878 garLoopResultBuilder]: At program point L546-1(lines 528 550) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0))) (or (not (= ~NP~0 1)) (and .cse0 (<= IofCallDriver_~returnVal2~0 0) (<= 0 IofCallDriver_~returnVal2~0)) (not (= ~NP~0 |old(~s~0)|)) (= ~pended~0 1) (not (<= 5 ~MPR1~0)) (not (<= 7 ~IPC~0)) (and (= ~setEventCalled~0 1) (<= IofCallDriver_~returnVal2~0 259) (<= 259 IofCallDriver_~returnVal2~0) (= ~MPR3~0 ~s~0) .cse1) (not (<= 4 ~SKIP2~0)) (and .cse0 .cse1) (not (<= 6 ~MPR3~0)) (not (= 2 ~DC~0)) (not (= ~compRegistered~0 1)))) [2022-04-15 17:42:08,287 INFO L878 garLoopResultBuilder]: At program point L509(lines 509 526) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,287 INFO L878 garLoopResultBuilder]: At program point L505(lines 504 527) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 (and (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))) (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3))) [2022-04-15 17:42:08,287 INFO L878 garLoopResultBuilder]: At program point L497(line 497) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~s~0 |old(~s~0)|) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,287 INFO L878 garLoopResultBuilder]: At program point L489(lines 489 501) the Hoare annotation is: (let ((.cse0 (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|))) (.cse1 (= ~pended~0 1)) (.cse2 (not (<= 7 ~IPC~0))) (.cse3 (not (<= 4 ~SKIP2~0))) (.cse4 (not (= 2 ~DC~0)))) (and (or (not (= ~NP~0 1)) .cse0 (not (= ~NP~0 |old(~s~0)|)) .cse1 (not (<= 5 ~MPR1~0)) .cse2 .cse3 (not (<= 6 ~MPR3~0)) .cse4 (not (= ~compRegistered~0 1))) (or .cse0 (not (= ~compRegistered~0 0)) .cse1 .cse2 .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4))) [2022-04-15 17:42:08,288 INFO L878 garLoopResultBuilder]: At program point L489-1(lines 489 501) the Hoare annotation is: (let ((.cse0 (= ~pended~0 1)) (.cse1 (not (<= 7 ~IPC~0))) (.cse2 (not (<= 4 ~SKIP2~0))) (.cse3 (not (= 2 ~DC~0)))) (and (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) .cse0 .cse1 .cse2 (not (= ~SKIP1~0 |old(~s~0)|)) .cse3) (or (not (= ~NP~0 1)) (and (= ~setEventCalled~0 1) (= ~MPR1~0 ~s~0) (= (+ IofCallDriver_~__cil_tmp7~0 1073741802) 0)) (not (= ~NP~0 |old(~s~0)|)) .cse0 (not (<= 5 ~MPR1~0)) .cse1 .cse2 (not (<= 6 ~MPR3~0)) .cse3 (not (= ~compRegistered~0 1))))) [2022-04-15 17:42:08,288 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= ~s~0 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-04-15 17:42:08,288 INFO L878 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) (= |old(~DevicePowerState~0)| ~DevicePowerState~0) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~s~0 |old(~s~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 17:42:08,288 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= ~s~0 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-04-15 17:42:08,288 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 17:42:08,288 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~s~0 ~DC~0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= ~DC~0 ~s~0) (= ~SKIP1~0 ~s~0) (= ~MPR1~0 ~s~0) (= ~compRegistered~0 0) (= ~MPR3~0 ~s~0)) [2022-04-15 17:42:08,288 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 17:42:08,288 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 17:42:08,288 INFO L878 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughENTRY(lines 665 688) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,288 INFO L878 garLoopResultBuilder]: At program point L684(line 684) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,288 INFO L885 garLoopResultBuilder]: At program point L684-1(line 684) the Hoare annotation is: true [2022-04-15 17:42:08,288 INFO L885 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughFINAL(lines 665 688) the Hoare annotation is: true [2022-04-15 17:42:08,288 INFO L878 garLoopResultBuilder]: At program point L678(line 678) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,288 INFO L878 garLoopResultBuilder]: At program point L678-1(lines 674 680) the Hoare annotation is: (or (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (= ~SKIP1~0 ~s~0) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,288 INFO L885 garLoopResultBuilder]: At program point KbFilter_DispatchPassThroughEXIT(lines 665 688) the Hoare annotation is: true [2022-04-15 17:42:08,288 INFO L878 garLoopResultBuilder]: At program point L674(lines 674 680) the Hoare annotation is: (or (and (= ~setEventCalled~0 |old(~setEventCalled~0)|) (= ~lowerDriverReturn~0 |old(~lowerDriverReturn~0)|) (= ~s~0 |old(~s~0)|)) (not (= ~NP~0 |old(~s~0)|)) (not (= ~compRegistered~0 0)) (= ~pended~0 1) (not (<= 7 ~IPC~0)) (not (<= 4 ~SKIP2~0)) (not (= 2 ~DC~0))) [2022-04-15 17:42:08,291 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-15 17:42:08,292 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 17:42:08,294 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 17:42:08,314 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 17:42:08,663 INFO L163 areAnnotationChecker]: CFG has 360 edges. 360 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 17:42:08,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:42:08 BoogieIcfgContainer [2022-04-15 17:42:08,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 17:42:08,707 INFO L158 Benchmark]: Toolchain (without parser) took 53149.53ms. Allocated memory was 199.2MB in the beginning and 399.5MB in the end (delta: 200.3MB). Free memory was 148.1MB in the beginning and 138.3MB in the end (delta: 9.8MB). Peak memory consumption was 214.2MB. Max. memory is 8.0GB. [2022-04-15 17:42:08,707 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 199.2MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 17:42:08,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.57ms. Allocated memory is still 199.2MB. Free memory was 147.9MB in the beginning and 165.9MB in the end (delta: -17.9MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-04-15 17:42:08,707 INFO L158 Benchmark]: Boogie Preprocessor took 68.58ms. Allocated memory is still 199.2MB. Free memory was 165.5MB in the beginning and 162.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-15 17:42:08,707 INFO L158 Benchmark]: RCFGBuilder took 642.11ms. Allocated memory is still 199.2MB. Free memory was 162.3MB in the beginning and 118.9MB in the end (delta: 43.4MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2022-04-15 17:42:08,707 INFO L158 Benchmark]: TraceAbstraction took 52130.93ms. Allocated memory was 199.2MB in the beginning and 399.5MB in the end (delta: 200.3MB). Free memory was 118.3MB in the beginning and 138.8MB in the end (delta: -20.5MB). Peak memory consumption was 184.4MB. Max. memory is 8.0GB. [2022-04-15 17:42:08,708 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.11ms. Allocated memory is still 199.2MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 295.57ms. Allocated memory is still 199.2MB. Free memory was 147.9MB in the beginning and 165.9MB in the end (delta: -17.9MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.58ms. Allocated memory is still 199.2MB. Free memory was 165.5MB in the beginning and 162.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 642.11ms. Allocated memory is still 199.2MB. Free memory was 162.3MB in the beginning and 118.9MB in the end (delta: 43.4MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * TraceAbstraction took 52130.93ms. Allocated memory was 199.2MB in the beginning and 399.5MB in the end (delta: 200.3MB). Free memory was 118.3MB in the beginning and 138.8MB in the end (delta: -20.5MB). Peak memory consumption was 184.4MB. 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: 1013]: 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 19 procedures, 242 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5432 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5417 mSDsluCounter, 6668 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3573 mSDsCounter, 1236 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6812 IncrementalHoareTripleChecker+Invalid, 8048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1236 mSolverCounterUnsat, 3095 mSDtfsCounter, 6812 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 189 SyntacticMatches, 4 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=3, InterpolantAutomatonStates: 173, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 149 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 239 LocationsWithAnnotation, 911 PreInvPairs, 1233 NumberOfFragments, 10930 HoareAnnotationTreeSize, 911 FomulaSimplifications, 1861 FormulaSimplificationTreeSizeReduction, 3.3s HoareSimplificationTime, 239 FomulaSimplificationsInter, 9411 FormulaSimplificationTreeSizeReductionInter, 8.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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: 422]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || ((((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && status == 0) && compRegistered == 0) && s == \old(s))) || !(2 == DC) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) && (((((((((!(NP == 1) || ((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && s == \old(s))) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((((((((!(NP == 1) || (((returnVal2 <= 0 && 0 <= returnVal2) && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || ((1073741823 + returnVal2 <= 0 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || ((((setEventCalled == 1 && returnVal2 <= 259) && 259 <= returnVal2) && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 1 || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || compRegistered <= 0) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && (compRegistered == 1 || compRegistered <= 0)) && 4 <= SKIP2)) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(NP == \old(s))) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 776]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (((((\old(customIrp) == customIrp && setEventCalled == \old(setEventCalled)) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && compRegistered == 0) && s == \old(s))) || !(6 <= MPR3)) || !(2 == DC) - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) && (((((((((!(NP == 1) || ((setEventCalled == 1 && MPR1 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || (((setEventCalled == \old(setEventCalled) && myStatus == \old(myStatus)) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s))) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || status == 0) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || (MPR1 == s && __cil_tmp7 + 1073741802 == 0)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((setEventCalled == \old(setEventCalled) && lowerDriverReturn == \old(lowerDriverReturn)) && s == \old(s)) || !(compRegistered == 0)) || pended == 1) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(SKIP1 == \old(s))) || !(2 == DC)) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || ((((((status == 0 && 7 <= IPC) && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || (((((((((6 <= MPR3 && status == 0) && 7 <= IPC) && 5 <= MPR1) && 2 == DC) && !(pended == 1)) && s == NP) && NP == 1) && 4 <= SKIP2) && compRegistered == 0)) || !(\old(s) <= \old(DC))) || !(\old(s) == \old(MPR3)) - ProcedureContractResult [Line: 568]: Procedure Contract for KeSetEvent Derived contract for procedure KeSetEvent: ((((((((setEventCalled == 1 || pended == 1) || !(s == NP)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) || !(s == 1) - ProcedureContractResult [Line: 618]: Procedure Contract for KbFilter_Complete Derived contract for procedure KbFilter_Complete: ((((((((pended == 1 || !(s == NP)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || ((1073741802 + \result <= 0 && setEventCalled == 1) && 0 <= 1073741802 + \result)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) || !(s == 1) - ProcedureContractResult [Line: 43]: Procedure Contract for stub_driver_init Derived contract for procedure stub_driver_init: ((((((((((!(pended == 1) && compRegistered == 0) && s == \old(s)) || !(NP == 1)) || !(NP == \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC) - ProcedureContractResult [Line: 689]: Procedure Contract for KbFilter_Power Derived contract for procedure KbFilter_Power: 1 - ProcedureContractResult [Line: 57]: Procedure Contract for _BLAST_init Derived contract for procedure _BLAST_init: (((((((!(\old(SKIP1) == \old(s)) || !(\old(DC) <= \old(s))) || \old(pended) == 1) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR1))) || !(\old(s) <= \old(DC))) || ((((((((6 <= MPR3 && 7 <= IPC) && 5 <= MPR1) && 2 == DC) && !(pended == 1)) && NP == 1) && 4 <= SKIP2) && compRegistered == 0) && !(MPR3 == s))) || !(\old(s) == \old(MPR3)) - ProcedureContractResult [Line: 1009]: Procedure Contract for errorFn Derived contract for procedure errorFn: 1 - ProcedureContractResult [Line: 295]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 481]: Procedure Contract for IofCallDriver Derived contract for procedure IofCallDriver: ((((((((((!(NP == 1) || ((((((setEventCalled == 1 && returnVal2 <= 259) && 259 <= \result) && \result <= 259) && 259 <= returnVal2) && MPR3 == s) && __cil_tmp7 + 1073741802 == 0)) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || (s == NP && __cil_tmp7 + 1073741802 == 0)) || ((((s == NP && returnVal2 <= 0) && 0 <= \result) && 0 <= returnVal2) && \result <= 0)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1) - ProcedureContractResult [Line: 467]: Procedure Contract for stubMoreProcessingRequired Derived contract for procedure stubMoreProcessingRequired: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(setEventCalled == 1)) || !(2 == DC)) || MPR1 == s) || !(compRegistered == 1) - ProcedureContractResult [Line: 745]: Procedure Contract for PoCallDriver Derived contract for procedure PoCallDriver: 1 - ProcedureContractResult [Line: 629]: Procedure Contract for KbFilter_CreateClose Derived contract for procedure KbFilter_CreateClose: 1 - ProcedureContractResult [Line: 822]: Procedure Contract for KbFilter_InternIoCtl Derived contract for procedure KbFilter_InternIoCtl: 1 - ProcedureContractResult [Line: 576]: Procedure Contract for KeWaitForSingleObject Derived contract for procedure KeWaitForSingleObject: (((((((((!(NP == 1) || !(NP == \old(s))) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(2 == DC)) || !(compRegistered == 1)) && ((((((((((!(NP == 1) || pended == 1) || !(5 <= MPR1)) || !(7 <= IPC)) || ((((7 <= IPC && 2 == DC) && !(pended == 1)) && s == NP) && 4 <= SKIP2)) || !(4 <= SKIP2)) || !(6 <= MPR3)) || !(\old(setEventCalled) == 1)) || !(2 == DC)) || !(compRegistered == 1)) || !(MPR3 == \old(s))) - ProcedureContractResult [Line: 554]: Procedure Contract for IofCompleteRequest Derived contract for procedure IofCompleteRequest: ((((((!(NP == \old(s)) || !(compRegistered == 0)) || pended == 1) || 2 == s) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC)) && ((((((!(NP == \old(s)) || pended == 1) || 2 == s) || !(7 <= IPC)) || !(4 <= SKIP2)) || !(2 == DC)) || !(compRegistered == 1)) - ProcedureContractResult [Line: 665]: Procedure Contract for KbFilter_DispatchPassThrough Derived contract for procedure KbFilter_DispatchPassThrough: 1 - ProcedureContractResult [Line: 81]: Procedure Contract for KbFilter_PnP Derived contract for procedure KbFilter_PnP: (((((((((compRegistered == 1 || !(NP == 1)) || !(NP == \old(s))) || pended == 1) || !(\old(compRegistered) == 0)) || !(5 <= MPR1)) || !(7 <= IPC)) || !(4 <= SKIP2)) || compRegistered <= 0) || !(6 <= MPR3)) || !(2 == DC) RESULT: Ultimate proved your program to be correct! [2022-04-15 17:42:08,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...